✦ LIBER ✦

Triangle-free regular graphs

✍ Scribed by A.F. Sidorenko

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 152 KB
Volume: 91
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90114-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on bipartite subgraphs of triangl

A note on bipartite subgraphs of triangle-free regular graphs

✍ S. C. Locke 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 2 views

## Abstract Lower bounds on the size of a maximum bipartite subgraph of a triangle‐free __r__‐regular graph are presented.

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

Toughness and Triangle-Free Graphs

✍ D. Bauer; J. Vandenheuvel; E. Schmeichel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 520 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).

11/30 (Finding Large Independent Sets in

11/30 (Finding Large Independent Sets in Connected Triangle-Free 3-Regular Graphs)

✍ K. Fraughnaugh; S.C. Locke 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 840 KB

2-factors in triangle-free graphs

✍ Bauer, D.; van den Heuvel, J.; Schmeichel, E. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 440 KB 👁 3 views

We study the cycle structure of I-tough, triangle-free graphs. In particular, w e prove that every such graph on n 2 3 vertices with minimum degree 6 2 i ( n + 2) has a 2-factor. W e also show this is best possible by exhibiting an infinite class of I-tough, triangle-free graphs having 6 = $ ( n + 1