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...
| Hlavní autoři: | , |
|---|---|
| Médium: | Článek |
| Jazyk: | English |
| Vydáno: |
Discrete Mathematics & Theoretical Computer Science
2005-01-01
|
| Edice: | Discrete Mathematics & Theoretical Computer Science |
| Témata: | |
| On-line přístup: | https://dmtcs.episciences.org/3391/pdf |