Abstract
AbstractThe separation dimension of a graph G is the minimum positive integer d for which there is an embedding of G into ℝd, such that every pair of disjoint edges are separated by some axis-parallel hyperplane. We prove a conjecture of Alon et al. [SIAM J. Discrete Math. 2015] by showing that every graph with maximum degree Δ has separation dimension less than 20Δ, which is best possible up to a constant factor. We also prove that graphs with separation dimension 3 have bounded average degree and bounded chromatic number, partially resolving an open problem by Alon et al. [J. Graph Theory 2018].
Publisher
Cambridge University Press (CUP)
Reference17 articles.
1. Probability and Computing
2. Boxicity of line graphs
3. On the dimensions of ordered sets of bounded degree
4. Frugal, acyclic and star colourings of graphs;Ross;Discrete Appl. Math.,2011
5. [9] Erdös, P. and Lovász, L. . Problems and results on 3-chromatic hyper-graphs and some related questions. In Infinite and Finite Sets, vol. 10 of Colloq. Math. Soc. János Bolyai (North-Holland, 1975), 609–627.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献