✦ LIBER ✦

On embedding of finite distance graphs with large chromatic number in random graphs

✍ Scribed by S. V. Nagaeva; A. M. Raigorodskii

Publisher: Springer US
Year: 2009
Tongue: English
Weight: 293 KB
Volume: 161
Category: Article
ISSN: 1573-8795
DOI: 10.1007/s10958-009-9594-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distance Graphs with Finite Chromatic Nu

Distance Graphs with Finite Chromatic Number

✍ I.Z. Ruzsa; Zs. Tuza; M. Voigt 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 96 KB

The distance graph G(D) with distance set D={d 1 , d 2 , ...} has the set Z of integers as vertex set, with two vertices i, j ¥ Z adjacent if and only if |i -j| ¥ D. We prove that the chromatic number of G(D) is finite whenever inf{d i+1 /d i } > 1 and that every growth speed smaller than this admit

On the structure of distance graphs with

On the structure of distance graphs with large chromatic numbers

✍ A. M. Raigorodskii 📂 Article 📅 2006 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 383 KB

Fractional chromatic number and circular

Fractional chromatic number and circular chromatic number for distance graphs with large clique size

✍ Daphne Der-Fen Liu; Xuding Zhu 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

## Abstract An Erratum has been published for this article in Journal of Graph Theory 48: 329–330, 2005. Let __M__ be a set of positive integers. The distance graph generated by __M__, denoted by __G__(__Z, M__), has the set __Z__ of all integers as the vertex set, and edges __ij__ whenever |__i__

On the chromatic number of special dista

On the chromatic number of special distance graphs

✍ M. Voigt; H. Walther 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 153 KB

## A b&act Voigt, M. and H. Walther, On the chromatic number of special distance graphs, Discrete Mathematics 97 (1991) 395-397. For all 12 10 and u 2 1' -61+ 3 the chromatic number is proved to be 3 for distance graphs with all integers as vertices, and edges only if the vertices are at distance

On the chromatic number of random geomet

On the chromatic number of random geometric graphs

✍ Colin Mcdiarmid; Tobias Müller 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 684 KB

Subgraphs of large connectivity and chro

Subgraphs of large connectivity and chromatic number in graphs of large chromatic number

✍ N. Alon; D. Kleitman; C. Thomassen; M. Saks; P. Seymour 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

For each pair k, rn of natural numbers there exists a natural number f(k, rn) such that every f ( k , m)-chromatic graph contains a k-connected subgraph of chromatic number at least rn.