Distances realized by sets covering the plane
From MaRDI portal
Publication:2557037
DOI10.1016/0097-3165(73)90020-4zbMath0251.50003OpenAlexW2030472577WikidataQ56610706 ScholiaQ56610706MaRDI QIDQ2557037
Publication date: 1973
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(73)90020-4
Polyhedra and polytopes; regular figures, division of spaces (51M20) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items
Strong Ramsey properties of simplices, Lifting of a bound for the chromatic number of \(\mathbb R^n\) to higher dimensions, Unit-distance graphs in rational n-spaces, On the chromatic numbers of rational spaces, Finite Euclidean Ramsey theory, The odd-distance plane graph, Universal covers of finite sets, An 18-colouring of 3-space omitting distance one, Edge-Ramsey theory, Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm, On the connectivity of unit distance graphs, On the chromatic number of an infinitesimal plane layer, Coloring distance graphs on the plane, A triangle-free, 4-chromatic \(\mathbb{Q}^3\) Euclidean distance graph Scavenger hunt!, Monochromatic triangles in two-colored plane, Clique numbers of finite unit-quadrance graphs, Every 5-coloured map in the plane contains a monochrome unit, The realization of distances in measurable subsets covering \(R^ n\)., On the chromatic number of subsets of the Euclidean plane, On four-colourings of the rational four-space, Coloring abelian groups, Polynomial configurations in sets of positive upper density over local fields, Connectivity of distance graphs, Borsuk's partition problem and finite point sets, A six-coloring of the plane, On a generalization of the Hadwiger-Nelson problem, The fractional chromatic number of the plane, Distance graphs with large chromatic number and without cliques of given size in the rational space, Triangle colorings require at least seven colors, ORTHOGONAL COLORINGS OF THE SPHERE, Additive \(k\)-colorable extensions of the rational plane, Distances forbidden by some two-coloring of \(\mathbb{Q}^ 2\), Unnamed Item, The Hadwiger–Nelson Problem, Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space, Bounds on the measurable chromatic number of \({\mathbb{R}}\), Simple product colorings, Patch colorings and rigid colorings of the rational \(n\)-space, On the connectedness of some geometric graphs
Cites Work
