✦ LIBER ✦

The diagnosability of triangle-free graphs

✍ Scribed by Lin, Cheng-Kuan; Teng, Yuan-Hsiang

Book ID: 122308669
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 364 KB
Volume: 530
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.02.024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Triangle-free regular graphs

✍ A.F. Sidorenko 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 152 KB

Median Graphs and Triangle-Free Graphs

✍ Imrich, Wilfried; Klavzar, Sandi; Mulder, Henry Martyn 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 260 KB

Triangle-free four-chromatic graphs

✍ Guoping Jin 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 640 KB

For given n, let G be a triangle-free graph of order n with chromatic number at least 4. In this paper, we shall prove a conjecture of H/iggkvist by determining the maximal value of 6(G).

Toughness and Triangle-Free Graphs

✍ D. Bauer; J. Vandenheuvel; E. Schmeichel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 520 KB

On triangle-free projective graphs

✍ S. Hazan 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 608 KB

On triangle-free random graphs

✍ Tomasz Łuczak 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB 👁 3 views

We show that for every k ≥ 1 and δ > 0 there exists a constant c > 0 such that, with probability tending to 1 as n → ∞, a graph chosen uniformly at random among all triangle-free graphs with n vertices and M ≥ cn 3/2 edges can be made bipartite by deleting δM edges. As an immediate consequence of th