On chromatic numbers of nearly Kneser distance graphs

DOI10.1134/S1064562416030091zbMath1348.05064OpenAlexW2470540875MaRDI QIDQ334403

A. E. Kupriyanov, A. V. Bobu, Andrei M. Raigorodskii

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (11)

Sharp bounds for the chromatic number of random Kneser graphs ⋮ Estimating the \(r\)-colorability threshold for a random hypergraph ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ On the stability of the independence number of a random subgraph ⋮ Random Kneser graphs and hypergraphs ⋮ On the chromatic number of a random subgraph of the Kneser graph ⋮ On threshold probability for the stability of independent sets in distance graphs ⋮ The number of edges in induced subgraphs of some distance graphs ⋮ Clique numbers of random subgraphs of some distance graphs ⋮ On the chromatic number of generalized Kneser hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lovász' theorem on the chromatic number of spheres revisited
• On the maximal number of edges in a uniform hypergraph with one forbidden intersection
• Intersection theorems with geometric consequences
• The complete nontrivial-intersection theorem for systems of finite sets
• Research Problems in Discrete Geometry
• Forbidden Intersections
• 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

This page was built for publication: On chromatic numbers of nearly Kneser distance graphs