✦ LIBER ✦

On triangle-free projective graphs

✍ Scribed by S. Hazan

Publisher: Springer
Year: 1996
Tongue: English
Weight: 608 KB
Volume: 35
Category: Article
ISSN: 0002-5240
DOI: 10.1007/bf01195494

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Triangle-free regular graphs

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

A note on maximal triangle-free graphs

✍ Wayne Goddard; Daniel J. Kleitman 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 1 views

## Abstract We show that a maximal triangle‐free graph on __n__ vertices with minimum degree δ contains an independent set of 3δ − __n__ vertices which have identical neighborhoods. This yields a simple proof that if the binding number of a graph is at least 3/2 then it has a triangle. This was con

On minimal 5-chromatic triangle-free gra

On minimal 5-chromatic triangle-free graphs

✍ David Avis 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 1 views

## Abstract It is shown that the minimum number of vertices in a triangle‐free 5‐chromatic graph is at least 19.

Spin Models on Triangle-Free Connected G

Spin Models on Triangle-Free Connected Graphs

✍ Kazumasa Nomura 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 388 KB

Spin models were introduced by V. Jones (Pac. J. Math. 137 (1989), 311 334) to construct invariants of knots and links. A spin model is defined as a pair S=(X, w) of a fine set X and a function w: X\_X Ä C satisfying several axioms. Let 1=(X, E) be a connected graph with the usual metric : X\_X Ä [0

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).