English

Annulus graphs in $\mathbb R^d$

Combinatorics 2023-09-20 v3

Abstract

A dd-dimensional annulus graph with radii R1R_1 and R2R_2 (here R2R10R_2\ge R_1\ge 0) is a graph embeddable in Rd\mathbb R^d so that two vertices uu and vv form an edge if and only if their images in the embedding are at distance in the interval [R1,R2][R_1, R_2]. In this paper we show that the family Ad(R1,R2)\mathcal A_d(R_1,R_2) of dd-dimensional annulus graphs with radii R1R_1 and R2R_2 is uniquely characterised by R2/R1R_2/R_1 when this ratio is sufficiently large. Moreover, as a step towards a better understanding of the structure of Ad(R1,R2)\mathcal A_d(R_1,R_2), we show that supGAd(R1,R2)χ(G)/ω(G)\sup_{G\in \mathcal A_d(R_1,R_2)} \chi(G)/\omega(G) is given by exp(O(d))\exp(O(d)) for all R1,R2R_1,R_2 satisfying R2R1>0R_2\ge R_1 > 0 and also exp(Ω(d))\exp(\Omega(d)) if moreover R2/R11.2R_2/R_1\ge 1.2.

Keywords

Cite

@article{arxiv.2112.09453,
  title  = {Annulus graphs in $\mathbb R^d$},
  author = {Lyuben Lichev and Tsvetomir Mihaylov},
  journal= {arXiv preprint arXiv:2112.09453},
  year   = {2023}
}

Comments

17 pages, 6 figures

R2 v1 2026-06-24T08:21:49.688Z