Lower bounds for the chromatic numbers of distance graphs with large girth
From MaRDI portal
Publication:2364552
Cites work
- {{#invoke:WikidataIB|getLink|Q3117615}} scientific article; zbMATH DE number 6009961 (Why is no real title available?)
- {{#invoke:WikidataIB|getLink|Q3464534}} scientific article; zbMATH DE number 6536189 (Why is no real title available?)
- {{#invoke:WikidataIB|getLink|Q4339095}} scientific article; zbMATH DE number 1017008 (Why is no real title available?)
- {{#invoke:WikidataIB|getLink|Q4484690}} scientific article; zbMATH DE number 1452727 (Why is no real title available?)
- {{#invoke:WikidataIB|getLink|Q4939324}} scientific article; zbMATH DE number 1406333 (Why is no real title available?)
- {{#invoke:WikidataIB|getLink|Q5808059}} scientific article; zbMATH DE number 3068973 (Why is no real title available?)
- {{#invoke:WikidataIB|getLink|Q2519261}} Around Borsuk's hypothesis
- {{#invoke:WikidataIB|getLink|Q2784519}} Borsuk's problem and the chromatic numbers of some metric spaces
- {{#invoke:WikidataIB|getLink|Q2847920}} Coloring distance graphs and graphs of diameters
- {{#invoke:WikidataIB|getLink|Q1946751}} Distance graphs with large chromatic number and arbitrary girth
- {{#invoke:WikidataIB|getLink|Q1957062}} Distance graphs with large chromatic number and without large cliques
- {{#invoke:WikidataIB|getLink|Q5412823}} Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
- {{#invoke:WikidataIB|getLink|Q3751579}} Forbidden Intersections
- {{#invoke:WikidataIB|getLink|Q3253064}} Graph Theory and Probability
- {{#invoke:WikidataIB|getLink|Q483655}} Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections
- {{#invoke:WikidataIB|getLink|Q492207}} Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle
- {{#invoke:WikidataIB|getLink|Q5396969}} Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
- {{#invoke:WikidataIB|getLink|Q3521039}} On distance graphs with large chromatic number but without large simplices
- {{#invoke:WikidataIB|getLink|Q4515856}} On the chromatic number of a space
- {{#invoke:WikidataIB|getLink|Q5175217}} On the chromatic number of a space with forbidden equilateral triangle
- {{#invoke:WikidataIB|getLink|Q3156762}} Research Problems in Discrete Geometry
- {{#invoke:WikidataIB|getLink|Q2851500}} Small clique and large chromatic number
- {{#invoke:WikidataIB|getLink|Q3508582}} The Mathematical Coloring Book
- {{#invoke:WikidataIB|getLink|Q5658113}} The realization of distances within sets in Euclidean space
- {{#invoke:WikidataIB|getLink|Q2451892}} Two notions of unit distance graphs
Cited in
(10)- Improved Frankl-Rödl theorem and some of its geometric consequences
- On the Frankl-Rödl theorem
- Distance graphs with large chromatic number and without cliques of given size in the rational space
- The chromatic number of space with forbidden regular simplex
- On a Frankl-Wilson theorem and its geometric corollaries
- Improvements of the Frankl-Rödl theorem and geometric consequences
- Counterexamples to Borsuk's conjecture with large girth
- Distance graphs with large chromatic number and arbitrary girth
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
- On the number of edges of a uniform hypergraph with a range of allowed intersections
This page was built for publication: Lower bounds for the chromatic numbers of distance graphs with large girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364552)
