Two notions of unit distance graphs

DOI10.1016/j.jcta.2014.02.006zbMath1295.05092arXiv1306.3916OpenAlexW2077152698MaRDI QIDQ2451892

Noga Alon, Andrey B. Kupavskii

Publication date: 26 May 2014

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.3916

zbMATH Keywords

graph representationgraph dimensionunit distance graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (13)

Lower bounds for the chromatic numbers of distance graphs with large girth ⋮ On the chromatic numbers of rational spaces ⋮ Embedding Euclidean distance graphs in \(\mathbb{R}^n\) and \(\mathbb{Q}^n\) ⋮ Unnamed Item ⋮ Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres ⋮ On threshold probabilities for the realization of a random graph by a geometric graph ⋮ On the chromatic numbers corresponding to exponentially Ramsey sets ⋮ Minimal graphs with respect to geometric distance realizability ⋮ The chromatic number of space with forbidden regular simplex ⋮ Embedding graphs in Euclidean space ⋮ Embedding graphs in Euclidean space ⋮ Deadlock Analysis and Resolution for Multi-robot Systems ⋮ The minrank of random graphs over arbitrary fields

Cites Work

• Unnamed Item
• New bounds for the distance Ramsey number
• On the dimension to represent a graph by a unit distance graph
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Note on induced subgraphs of the unit distance graph \(E^ n\)
• Short cycles in random regular graphs
• Distance graphs with large chromatic number and arbitrary girth
• On the number of zero-patterns of a sequence of polynomials
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• The chromatic number of random graphs

This page was built for publication: Two notions of unit distance graphs