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

DOI10.1134/S0001434619030039zbMath1480.05051OpenAlexW2943849695MaRDI QIDQ2314097

Publication date: 19 July 2019

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434619030039

zbMATH Keywords

Nelson-Erdős-Hadwiger problem linear-algebraic method chromatic number of space with forbidden one-color triangles

Mathematics Subject Classification ID

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)

Related Items (2)

Estimate of the number of edges in special subgraphs of a distance graph ⋮ A generalization of Kneser graphs

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Estimate for the chromatic number of Euclidean space with several forbidden distances
On the chromatic numbers of spheres in $\mathbb R^n$
New bounds for the chromatic number of a space with forbidden isosceles triangles
A size-sensitive inequality for cross-intersecting families
Distance graph on $\mathbb Z^n$ with $\ell_{1}$ norm
On the chromatic number of with an arbitrary norm
On lower bounds for the chromatic number of sphere
Intersection theorems with geometric consequences
Intersection theorems for $\{0,\pm1\}$-vectors and $s$-cross-intersecting families
Chromatic number with several forbidden distances in the space with the $\ell_q$-metric
Erdős-Ko-Rado theorem for $\{0,\pm 1\}$-vectors
Cascade search for preimages and coincidences: global and local versions
On the chromatic number of Euclidean space with two forbidden distances
New lower bound for the chromatic number of a rational space with one and two forbidden distances
On the chromatic numbers of low-dimensional spaces
Improvements of the Frankl-Rödl theorem and geometric consequences
Turán-type bounds for distance graphs
On the number of edges in a uniform hypergraph with a range of permitted intersections
Borsuk's problem and the chromatic numbers of some metric spaces
Coloring Distance Graphs and Graphs of Diameters
Research Problems in Discrete Geometry
On the colouring of spheres embedded in $ \mathbb R^n$
The Mathematical Coloring Book
On the chromatic number of a space
On the chromatic number of an infinitesimal plane layer
Combinatorial Geometry and Coding Theory*
A new lower bound for the chromatic number of the rational space
The realization of distances within sets in Euclidean space

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