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...
Үндсэн зохиолчид: | Javier Barajas, Oriol Serra |
---|---|
Формат: | Өгүүллэг |
Хэл сонгох: | English |
Хэвлэсэн: |
Discrete Mathematics & Theoretical Computer Science
2005-01-01
|
Цуврал: | Discrete Mathematics & Theoretical Computer Science |
Нөхцлүүд: | |
Онлайн хандалт: | https://dmtcs.episciences.org/3391/pdf |
Ижил төстэй зүйлс
Ижил төстэй зүйлс
-
An upper bound for the chromatic number of line graphs
-н: Andrew D. King, зэрэг
Хэвлэсэн: (2005-01-01) -
(k − 2)-linear connected components in hypergraphs of rank k
-н: Florian Galliot, зэрэг
Хэвлэсэн: (2023-11-01) -
On Kerov polynomials for Jack characters (extended abstract)
-н: Valentin Féray, зэрэг
Хэвлэсэн: (2013-01-01) -
On the $L(p,1)$-labelling of graphs
-н: Daniel Gonçalves
Хэвлэсэн: (2005-01-01) -
Staircase Macdonald polynomials and the $q$-Discriminant
-н: Adrien Boussicault, зэрэг
Хэвлэсэн: (2008-01-01)