Distance graphs having large chromatic numbers and containing no cliques or cycles of a given size

作者：Demekhin E E^*; Raigorodskii A M; Rubanov O I

来源：Sbornik: Mathematics , 2013, 204(4): 508-538.

DOI：10.1070/SM2013v204n04ABEH004310

• distance graph
• random graph
• chromatic number
• clique
• cycle

It is established that there exist sequences of distance graphs G(n) subset of R-n, with chromatic numbers which grow exponentially, but, at the same time, without cliques or cycles of a given size.

• 出版日期2013