Annulus Graphs in Rd

Lyuben Lichev, Tsvetomir Mihaylov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

68 Downloads (Pure)

Abstract

A d-dimensional annulus graph with radii R1 and R2 (here R2≥R1≥0) is a graph embeddable in Rd so that two vertices u and v form an edge if and only if their images in the embedding are at distance in the interval [R1, R2]. In this paper we show that the family Ad(R1, R2) of d-dimensional annulus graphs with radii R1 and R2 is uniquely characterised by R2/R1 when this ratio is sufficiently large. Moreover, as a step towards a better understanding of the structure of Ad(R1, R2), we show that supG∈Ad(R1, R2)χ(G)/ω(G) is given by exp(O(d)) for all R1, R2 satisfying R2≥R1>0 and also exp(Ω(d)) if moreover R2/R1≥1.2.
Original languageEnglish
Pages (from-to)379-401
Number of pages23
JournalDiscrete & Computational Geometry
Volume72
Issue number1
Early online date16 May 2024
DOIs
Publication statusPublished - 1 Jul 2024

Keywords

  • 51K99
  • Clique number
  • 05C10
  • Chromatic number
  • Geometric embedding
  • Annulus graph

Fingerprint

Dive into the research topics of 'Annulus Graphs in Rd'. Together they form a unique fingerprint.

Cite this