The realization of distances within sets in Euclidean space

DOI10.1112/S0025579300004903zbMath0246.05020MaRDI QIDQ5658113

C. A. Rogers, David G. Larman

Publication date: 1972

Published in: Mathematika (Search for Journal in Brave)

Mathematics Subject Classification ID

Other designs, configurations (05B30) Real and complex geometry (51M99) Designs and configurations (05B99)

Related Items (only showing first 100 items - show all)

The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances ⋮ Large cycles in generalized Johnson graphs ⋮ Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions ⋮ Independence numbers of Johnson-type graphs ⋮ Max-norm Ramsey theory ⋮ A COUNTEREXAMPLE TO A CONJECTURE OF LARMAN AND ROGERS ON SETS AVOIDING DISTANCE 1 ⋮ Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii ⋮ On the chromatic numbers of small-dimensional Euclidean spaces ⋮ Bounding the Size of an Almost-Equidistant Set in Euclidean Space ⋮ On the chromatic numbers of low-dimensional spaces ⋮ On the density of sets of the Euclidean plane avoiding distance 1 ⋮ Lower bounds for the chromatic numbers of distance graphs with large girth ⋮ Better bounds for planar sets avoiding unit distances ⋮ On large subgraphs with small chromatic numbers contained in distance graphs ⋮ On the chromatic numbers of integer and rational lattices ⋮ Strong Ramsey properties of simplices ⋮ Codes with given distances ⋮ Lifting of a bound for the chromatic number of \(\mathbb R^n\) to higher dimensions ⋮ On embedding of finite distance graphs with large chromatic number in random graphs ⋮ On a bound in extremal combinatorics ⋮ 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 ⋮ Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances ⋮ Independence numbers and chromatic numbers of the random subgraphs of some distance graphs ⋮ Finite Euclidean Ramsey theory ⋮ Edge-Ramsey theory ⋮ Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm ⋮ Almost-equidistant sets ⋮ On the structure of distance graphs with large chromatic numbers ⋮ On the chromatic number of an infinitesimal plane layer ⋮ On the number of edges in a uniform hypergraph with a range of permitted intersections ⋮ On the chromatic numbers of spheres in Euclidean spaces ⋮ Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres ⋮ On lower bounds for the chromatic number of sphere ⋮ An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges ⋮ On Ramsey Type Problems in Combinatorial Geometry ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size ⋮ On a Frankl-Rödl theorem and its geometric corollaries ⋮ On the chromatic number of with an arbitrary norm ⋮ Extremal problems and coverings of the space ⋮ Chromatic numbers of spaces with forbidden monochromatic triangles ⋮ On the chromatic numbers corresponding to exponentially Ramsey sets ⋮ On distance subgraphs of graphs in spaces of lower dimensions ⋮ The realization of distances in measurable subsets covering \(R^ n\). ⋮ On the chromatic number for a set of metric spaces ⋮ A result in asymmetric Euclidean Ramsey theory ⋮ On the Frankl–Rödl theorem ⋮ Distance graphs with large chromatic number and without large cliques ⋮ On the chromatic numbers of spheres in \(\mathbb R^n\) ⋮ On the combinatorial problems which I would most like to see solved ⋮ On the chromatic number of \(\mathbb R^4\) ⋮ Intersection theorems with geometric consequences ⋮ Monochromatic equilateral triangles in the unit distance graph ⋮ New bounds for the chromatic number of a space with forbidden isosceles triangles ⋮ The Namer-Claimer game ⋮ On the chromatic number of \(\mathbb{R}^{9}\) ⋮ On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem ⋮ Polynomial configurations in sets of positive upper density over local fields ⋮ On the chromatic number of a space with two forbidden distances ⋮ The chromatic number of the space $( {\mathbb R}^n, l_1)$ ⋮ 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 ⋮ Colorings of spaces, and random graphs ⋮ On the Borsuk and Erdős-Hadwiger numbers ⋮ Colorings of the space \(\mathbb R^{n}\) with several forbidden distances ⋮ Embeddability of finite distance graphs with a large chromatic number in random graphs ⋮ Sets of vectors with many orthogonal pairs ⋮ Distance graphs with large chromatic numbers and small clique numbers ⋮ One problem on geometric Ramsey numbers ⋮ The chromatic number of \(\mathbb R^n\) with a set of forbidden distances ⋮ New estimates in the problem of the number of edges in a hypergraph with forbidden intersections ⋮ Forbidden Intersections ⋮ Chromatic numbers of spheres ⋮ Exponentially Ramsey sets ⋮ Distance graphs with large chromatic number and without cliques of given size in the rational space ⋮ Chromatic numbers of distance graphs without short odd cycles in rational spaces ⋮ On the chromatic number of Euclidean space and the Borsuk problem ⋮ On a series of Ramsey-type problems in combinatorial geometry ⋮ On the chromatic number of a space with several forbidden distances ⋮ Around Borsuk's hypothesis ⋮ Chromatic numbers of metric spaces ⋮ A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space ⋮ The Hadwiger–Nelson Problem ⋮ 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\) ⋮ Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space ⋮ 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 ⋮ Bounds on the measurable chromatic number of \({\mathbb{R}}\) ⋮ On the chromatic number of random subgraphs of a certain distance graph ⋮ On the density of sets avoiding parallelohedron distance 1 ⋮ Lower bounds for measurable chromatic numbers ⋮ Small clique and large chromatic number ⋮ Counterexamples to Borsuk's conjecture with large girth ⋮ Patch colorings and rigid colorings of the rational \(n\)-space ⋮ All finite sets are Ramsey in the maximum norm ⋮ Specified intersections ⋮ 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

Cites Work

• Realization of all distances in a decomposition of the space \(R^ n\) into \(n+1\) parts
• Some Sphere Packings in Higher Space
• Notes on Sphere Packings
• On a conjecture of milner on k-graphs with non-disjoint edges
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• A Group of Order 8,315,553,613,086,720,000
• The Closest Packing of Spherical Caps in n Dimensions

This page was built for publication: The realization of distances within sets in Euclidean space