The realization of distances within sets in Euclidean space

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
A Group of Order 8,315,553,613,086,720,000
SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
The Closest Packing of Spherical Caps in n Dimensions
On a conjecture of milner on k-graphs with non-disjoint edges

Cited In (only showing first 100 items - show all)

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

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

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