On chromatic numbers of nearly Kneser distance graphs
From MaRDI portal
Publication:334403
DOI10.1134/S1064562416030091zbMATH Open1348.05064OpenAlexW2470540875MaRDI QIDQ334403FDOQ334403
Andrei M. Raigorodskii, Aleksandr È. Kupriyanov, Andrei V. Bobu
Publication date: 1 November 2016
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064562416030091
Recommendations
- On chromatic numbers of close-to-Kneser distance graphs
- scientific article
- On the chromatic numbers of some distance graphs
- The chromatic numbers of distance graphs
- The chromatic numbers of distance graphs
- Chromatic numbers of some distance graphs
- ON DISTANCES IN CHROMATIC GRAPHS
- Chromatic numbers of exact distance graphs
- On the chromatic number of special distance graphs
- The chromatic numbers of some Euclidean distance graphs
Cites Work
- Research Problems in Discrete Geometry
- Forbidden Intersections
- Intersection theorems with geometric consequences
- The complete nontrivial-intersection theorem for systems of finite sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lovász' theorem on the chromatic number of spheres revisited
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
Cited In (13)
- On the chromatic number of generalized Kneser hypergraphs
- On the number of edges of a uniform hypergraph with a range of allowed intersections
- On threshold probability for the stability of independent sets in distance graphs
- Sharp bounds for the chromatic number of random Kneser graphs
- Estimating the \(r\)-colorability threshold for a random hypergraph
- On the stability of the independence number of a random subgraph
- Mean distance and chromatic number
- Sharp bounds for the chromatic number of random Kneser graphs
- Random Kneser graphs and hypergraphs
- Estimate of the number of edges in special subgraphs of a distance graph
- On the chromatic number of a random subgraph of the Kneser graph
- Clique numbers of random subgraphs of some distance graphs
- The number of edges in induced subgraphs of some distance graphs
This page was built for publication: On chromatic numbers of nearly Kneser distance graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q334403)
