Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Erd?s problems and related topics of discrete geometry (52C10)

Recommendations

New lower bounds for the chromatic number of a space with forbidden isosceles triangles
On the chromatic number of a space with forbidden equilateral triangle
On the chromatic numbers of low-dimensional spaces
Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
On lower bounds for the chromatic number of spheres

Cites work

A new lower bound for the chromatic number of the rational space
A size-sensitive inequality for cross-intersecting families
Borsuk's problem and the chromatic numbers of some metric spaces
Cascade search for preimages and coincidences: global and local versions
Chromatic number with several forbidden distances in the space with the \(\ell_q\)-metric
Coloring distance graphs and graphs of diameters
Combinatorial geometry and coding theory
Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm
Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
Estimate for the chromatic number of Euclidean space with several forbidden distances
scientific article; zbMATH DE number 3845607 (Why is no real title available?)
scientific article; zbMATH DE number 1943977 (Why is no real title available?)
scientific article; zbMATH DE number 1406330 (Why is no real title available?)
scientific article; zbMATH DE number 3098608 (Why is no real title available?)
Improvements of the Frankl-Rödl theorem and geometric consequences
Intersection theorems for \(\{0,\pm1\}\)-vectors and \(s\)-cross-intersecting families
Intersection theorems with geometric consequences
New bounds for the chromatic number of a space with forbidden isosceles triangles
New lower bound for the chromatic number of a rational space with one and two forbidden distances
On lower bounds for the chromatic number of sphere
On the chromatic number of a space
On the chromatic number of an infinitesimal plane layer
On the chromatic number of Euclidean space with two forbidden distances
On the chromatic number of with an arbitrary norm
On the chromatic numbers of low-dimensional spaces
On the chromatic numbers of spheres in \(\mathbb R^n\)
On the colouring of spheres embedded in R^n
On the number of edges in a uniform hypergraph with a range of permitted intersections
Research Problems in Discrete Geometry
The Mathematical Coloring Book
The realization of distances within sets in Euclidean space
Turán-type bounds for distance graphs

Cited in

(5)

Estimate of the number of edges in special subgraphs of a distance graph
A generalization of Kneser graphs
New lower bound for the chromatic number of a rational space with one and two forbidden distances
New lower bounds for the chromatic number of a space with forbidden isosceles triangles
On the chromatic number of a space with forbidden equilateral triangle

This page was built for publication: Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2314097)