✦ LIBER ✦

On the Edge Distribution in Triangle-free Graphs

✍ Scribed by M. Krivelevich

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 517 KB
Volume: 63
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1995.1018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Acyclic edge coloring of triangle-free p

Acyclic edge coloring of triangle-free planar graphs

✍ Manu Basavaraju; L. Sunil Chandran 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB 👁 2 views

An __acyclic__ edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The __acyclic chromatic index__ of a graph is the minimum number __k__ such that there is an acyclic edge coloring using __k__ colors and is denoted by __a__′(__G__). It was conjectured by Al

Triangle-free partial graphs and edge co

Triangle-free partial graphs and edge covering theorems

✍ J. Lehel; Zs. Tuza 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 722 KB

In Section 1 some lower bounds are given for the maximal number of edges of a (p -l)colorable partial graph. Among others we show that a graph on n vertices with m edges has a (p -l)-colorable partiai graph with at least mT,.$(;) edges, where T,,p denotes the so called Turin number. These results ar

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

On light edges and triangles in projecti

On light edges and triangles in projective planar graphs

✍ Sanders, Daniel P. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 376 KB 👁 2 views

An edge or face of an embedded graph is light if the sum of the degrees of the vertices incident with it is small. This paper parallelizes four inequalities on the number of light edges and light triangles from the plane to the projective plane. Each of the four inequalities is shown to be the best

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

Degree sequences in triangle-free graphs

✍ Paul Erdős; Siemion Fajtlowicz; William Staton 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 250 KB