Coloring Distance Graphs and Graphs of Diameters
From MaRDI portal
Publication:2847920
DOI10.1007/978-1-4614-0110-0_23zbMath1272.05058OpenAlexW173231963MaRDI QIDQ2847920
Publication date: 25 September 2013
Published in: Thirty Essays on Geometric Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0110-0_23
Related Items (78)
On the measurable chromatic number of a space of dimension \(n \leq 24\) ⋮ On chromatic numbers of close-to-Kneser distance graphs ⋮ Lower bounds for the chromatic numbers of distance graphs with large girth ⋮ Independence numbers of random subgraphs of a distance graph ⋮ On computational complexity of length embeddability of graphs ⋮ Turán-type results for distance graphs in an infinitesimal plane layer ⋮ On the number of edges in induced subgraphs of a special distance graph ⋮ Independence numbers of random subgraphs of distance graphs ⋮ A new estimate for the number of edges in induced subgraphs of a special distance graph ⋮ On the chromatic numbers of rational spaces ⋮ Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets ⋮ Turán type results for distance graphs ⋮ On the distance and multidistance graph embeddability problem ⋮ Independence numbers and chromatic numbers of the random subgraphs of some distance graphs ⋮ On simplices in diameter graphs in \(\mathbb{R}^4\) ⋮ Coverings of planar and three-dimensional sets with subsets of smaller diameter ⋮ On the chromatic number of an infinitesimal plane layer ⋮ Unnamed Item ⋮ Borsuk's problem, Boltyanski's illumination problem, and circumradius ⋮ Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs ⋮ Diameters of random distance graphs ⋮ On threshold probabilities for the realization of a random graph by a geometric graph ⋮ On lower bounds for the chromatic number of sphere ⋮ Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors ⋮ Large cycles in generalized Johnson graphs ⋮ On a Frankl-Wilson theorem ⋮ On complexity of multidistance graph recognition in \(\mathbb{R}^1\) ⋮ Interview with Andrei Raigorodskii ⋮ Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions ⋮ Chromatic numbers of some distance graphs ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ On the partition of plane sets into 6 subsets of small diameter ⋮ Intersection theorems for \((- 1, 0, 1)\)-vectors ⋮ Max-norm Ramsey theory ⋮ On the chromatic numbers corresponding to exponentially Ramsey sets ⋮ A result in asymmetric Euclidean Ramsey theory ⋮ On the Frankl–Rödl theorem ⋮ New bounds for the chromatic number of a space with forbidden isosceles triangles ⋮ Realization of subgraphs of random graphs by graphs of diameters in Euclidean spaces ⋮ Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections ⋮ Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs ⋮ Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii ⋮ 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 ⋮ Ramsey theory in the -space with Chebyshev metric ⋮ On the stability of some Erdős-Ko-Rado type results ⋮ Lower bound for the chromatic number of a rational space with metric \(l_u\) and with one forbidden distance ⋮ The chromatic number of space with forbidden regular simplex ⋮ On random subgraphs of Kneser graphs and their generalizations ⋮ Zero-one laws for random distance graphs with vertices in \(\{0,1\}^n\) ⋮ One problem on geometric Ramsey numbers ⋮ New estimates in the problem of the number of edges in a hypergraph with forbidden intersections ⋮ Zero-one law for random distance graphs with vertices in \(\{-1,0,1\}^n\) ⋮ On a relation between packing and covering densities of convex bodies ⋮ Chromatic numbers of spheres ⋮ Exponentially Ramsey sets ⋮ Distance graphs with large chromatic number and without cliques of given size in the rational space ⋮ On threshold probability for the stability of independent sets in distance graphs ⋮ Chromatic numbers of distance graphs without short odd cycles in rational spaces ⋮ ORTHOGONAL COLORINGS OF THE SPHERE ⋮ On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces ⋮ Hamiltonian paths in distance graphs ⋮ Small Subgraphs in Random Distance Graphs ⋮ A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space ⋮ Unnamed Item ⋮ On lower bounds for the chromatic number of spheres ⋮ A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) ⋮ Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles ⋮ Improved Frankl-Rödl theorem and some of its geometric consequences ⋮ Clique numbers of random subgraphs of some distance graphs ⋮ Counterexamples to Borsuk's conjecture with large girth ⋮ All finite sets are Ramsey in the maximum norm ⋮ New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs ⋮ On large subgraphs of a distance graph which have small chromatic number ⋮ New upper bound for the chromatic number of a random subgraph of a distance graph ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\) ⋮ New lower bound for the chromatic number of a rational space with one and two forbidden distances ⋮ Independence numbers and chromatic numbers of some distance graphs ⋮ New lower bounds for the chromatic number of a space with forbidden isosceles triangles
This page was built for publication: Coloring Distance Graphs and Graphs of Diameters
