Distance graphs with maximum chromatic number

Let $D$ be a finite set of integers. The distance graph $G(D)$ has the set of integers as vertices and two vertices at distance $d ∈D$ are adjacent in $G(D)$. A conjecture of Xuding Zhu states that if the chromatic number of $G (D)$ achieves its maximum value $|D|+1$ then the graph has a clique of o...

Fuld beskrivelse

Bibliografiske detaljer

Principais autores:	Javier Barajas, Oriol Serra
Format:	Artigo
Sprog:	Inglês
Udgivet:	Discrete Mathematics & Theoretical Computer Science 2005-01-01
Serier:	Discrete Mathematics & Theoretical Computer Science
Fag:	distance graphs chromatic number [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [math.math-co] mathematics [math]/combinatorics [math.co]
Online adgang:	https://dmtcs.episciences.org/3391/pdf
Tags:	Tilføj Tag Ingen Tags, Vær først til at tagge denne postø!