A generalization of Kneser graphs
From MaRDI portal
Publication:2191979
DOI10.1134/S0001434620030037zbMath1442.05055OpenAlexW3019715005MaRDI QIDQ2191979
A. V. Bobu, A. E. Kupriyanov, Andrei M. Raigorodskii
Publication date: 26 June 2020
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434620030037
Related Items
On Ramsey numbers for arbitrary sequences of graphs ⋮ On the minimal number of edges in induced subgraphs of special distance graphs ⋮ On stability of the independence number of a certain distance graph ⋮ On dividing sets into parts of smaller diameter ⋮ Modularity of some distance graphs ⋮ Bounds on Borsuk numbers in distance graphs of a special type ⋮ New Turán type bounds for Johnson graphs ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
Cites Work
- On random subgraphs of Kneser and Schrijver graphs
- Lovász' theorem on the chromatic number of spheres revisited
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- On random subgraphs of Kneser graphs and their generalizations
- A size-sensitive inequality for cross-intersecting families
- Random Kneser graphs and hypergraphs
- On the chromatic number of a random subgraph of the Kneser graph
- Kneser's conjecture, chromatic number, and homotopy
- On the stability of the Erdős-Ko-Rado theorem
- On lower bounds for the chromatic number of sphere
- Intersection theorems with geometric consequences
- On a bound in extremal combinatorics
- Diversity of uniform intersecting families
- Intersection theorems for \(\{0,\pm1\}\)-vectors and \(s\)-cross-intersecting families
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- Regular bipartite graphs and intersecting families
- On the chromatic numbers of some distance graphs
- New inequalities for families without \(k\) pairwise disjoint members
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
- New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs
- On the chromatic numbers of low-dimensional spaces
- On chromatic numbers of close-to-Kneser distance graphs
- On the number of edges in a uniform hypergraph with a range of permitted intersections
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Borsuk's problem and the chromatic numbers of some metric spaces
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- On the colouring of spheres embedded in $ \mathbb R^n$
- Families of vectors without Antipodal pairs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Counting Intersecting and Pairs of Cross-Intersecting Families
- Combinatorial Geometry and Coding Theory*
- Extremal problems in hypergraph colourings
- Uniform s-Cross-Intersecting Families
- On the chromatic numbers of small-dimensional Euclidean spaces
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
