✦ LIBER ✦

Embeddability of finite distance graphs with a large chromatic number in random graphs

✍ Scribed by S. V. Nagaeva

Book ID: 111454512
Publisher: SP MAIK Nauka/Interperiodica
Year: 2008
Tongue: English
Weight: 177 KB
Volume: 77
Category: Article
ISSN: 1064-5624
DOI: 10.1134/s1064562408010043

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On embedding of finite distance graphs w

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

✍ S. V. Nagaeva; A. M. Raigorodskii 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 293 KB

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

Distance graphs with large chromatic num

Distance graphs with large chromatic number and without large cliques

✍ A. M. Raigorodskii; O. I. Rubanov 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 631 KB

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__

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.