𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Degree sequences in triangle-free graphs

✍ Scribed by Paul Erdős; Siemion Fajtlowicz; William Staton

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
250 KB
Volume
92
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On decomposition of triangle-free graphs
On decomposition of triangle-free graphs under degree constraints
✍ Kaneko, Atsushi 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB 👁 2 views

We prove that if s and t are positive integers and if G is a triangle-free graph with minimum degree s + t, then the vertex set of G has a decomposition into two sets which induce subgraphs of minimum degree at least s and t, respectively.

Size and independence in triangle-free g
Size and independence in triangle-free graphs with maximum degree three
✍ Kathryn Fraughnaugh Jones 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 549 KB

## Abstract Let __C__ be the class of triangle‐free graphs with maximum degree at most three. A lower bound for the number of edges in a graph of __C__ is derived in terms of the number of vertices and the independence. Several classes of graphs for which this bound is attained are given. As coroll

Largest bipartite subgraphs in triangle-
Largest bipartite subgraphs in triangle-free graphs with maximum degree three
✍ J. A. Bondy; S. C. Locke 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 977 KB

Let G be a triangle-free, loopless graph with maximum degree three. We display a polynomi$ algorithm which returns a bipartite subgraph of G containing at least 5 of the edges of G. Furthermore, we characterize the dodecahedron and the Petersen graph as the only 3-regular, triangle-free, loopless, c

Degree sequence and independence in K(4)
Degree sequence and independence in K(4)-free graphs
✍ Paul Erdős; Ralph Faudree; Talmage James Reid; Richard Schelp; William Staton 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 268 KB

We investigate whether K,-free graphs with few repetitions in the degree sequence may have independence number o(n). We settle the cases r = 3 and r >/5, and give partial results for the very interesting case r=4. In an earlier article I-4] it is shown that triangle-free graphs in which no term of