Distance graphs with large chromatic number and without cliques of given size in the rational space
From MaRDI portal
Publication:2282833
Recommendations
- Distance graphs with large chromatic number and without large cliques
- On the structure of distance graphs with large chromatic numbers
- On the structure of distance graphs with a large chromatic number
- Distance graphs with large chromatic number and arbitrary girth
- Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size
- Chromatic numbers of distance graphs without short odd cycles in rational spaces
- Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
- On large subgraphs of a distance graph which have small chromatic number
Cites work
- A new lower bound for the chromatic number of the rational space
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring distance graphs and graphs of diameters
- Combinatorial geometry and coding theory
- Counterexamples to Borsuk's conjecture with large girth
- Distance graphs with large chromatic number and without large cliques
- Distances realized by sets covering the plane
- Estimate for the chromatic number of Euclidean space with several forbidden distances
- Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
- scientific article; zbMATH DE number 6009961 (Why is no real title available?)
- scientific article; zbMATH DE number 6536189 (Why is no real title available?)
- scientific article; zbMATH DE number 653246 (Why is no real title available?)
- scientific article; zbMATH DE number 1943977 (Why is no real title available?)
- scientific article; zbMATH DE number 2058509 (Why is no real title available?)
- scientific article; zbMATH DE number 1406330 (Why is no real title available?)
- Improvements of the Frankl-Rödl theorem and geometric consequences
- Intersection theorems with geometric consequences
- Lovász' theorem on the chromatic number of spheres revisited
- Lower bound for the chromatic number of a rational space with metric \(l_u\) and with one forbidden distance
- Lower bounds for the chromatic numbers of distance graphs with large girth
- New lower bound for the chromatic number of a rational space with one and two forbidden distances
- On a Frankl-Rödl theorem and its geometric corollaries
- On distance graphs with large chromatic number but without large simplices
- On lower bounds for the chromatic number of sphere
- On lower bounds for the chromatic number of spheres
- On the chromatic number of a space with a forbidden regular simplex
- On the chromatic number of an infinitesimal plane layer
- On the chromatic number of real and rational spaces
- On the chromatic numbers of low-dimensional spaces
- Random graphs.
- The chromatic number of a space with the metric l_q
- The chromatic number of space with forbidden regular simplex
- The Erdős-Hadwiger problem and the chromatic numbers of finite geometric graphs
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The realization of distances within sets in Euclidean space
- Turán type results for distance graphs
- Turán-type bounds for distance graphs
Cited in
(2)
This page was built for publication: Distance graphs with large chromatic number and without cliques of given size in the rational space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2282833)
