On chromatic numbers of nearly Kneser distance graphs

DOI10.1134/S1064562416030091MaRDI QIDQ334403zbMATHOpenAlexFDO

Authors Andrei V. Bobu, Aleksandr È. Kupriyanov, 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

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

Recommendations

• On chromatic numbers of close-to-Kneser distance graphs
• scientific article; zbMATH DE number 57114
• 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

• scientific article; zbMATH DE number 5935733 (Why is no real title available?)
• scientific article; zbMATH DE number 6536189 (Why is no real title available?)
• scientific article; zbMATH DE number 46958 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Forbidden Intersections
• Intersection theorems with geometric consequences
• Lovász' theorem on the chromatic number of spheres revisited
• On the maximal number of edges in a uniform hypergraph with one forbidden intersection
• Research Problems in Discrete Geometry
• The complete nontrivial-intersection theorem for systems of finite sets
• 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

Cited in

(15)

• On threshold probability for the stability of independent sets in distance graphs
• On the stability of the independence number of a random subgraph
• On chromatic numbers of close-to-Kneser distance graphs
• On the chromatic number of generalized Kneser hypergraphs
• 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
• Independence numbers and chromatic numbers of some distance graphs
• 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
• Sharp bounds for the chromatic number of random Kneser graphs
• Mean distance and chromatic number

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)