𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Density Conditions For Triangles In Multipartite Graphs

✍ Scribed by Adrian Bondy; Jian Shen; Stéphan Thomassé; Carsten Thomassen

Book ID
106167585
Publisher
Springer-Verlag
Year
2006
Tongue
English
Weight
168 KB
Volume
26
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A local density condition for triangles
A local density condition for triangles
✍ P. Erdős; R.J. Faudree; C.C. Rousseau; R.H. Schelp 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 516 KB

Let G be a graph on n vertices and let z and B be real numbers, 0 <a, /?< 1. Further, let G satisfy the condition that each LWI J subset of its vertex set spans at least /In2 edges. The following question is considered. For a fixed G( what is the smallest value of fl such that G contains a triangle?

Cliques and extended triangles. A necess
Cliques and extended triangles. A necessary condition for planar clique graphs
✍ Liliana Alcón; Marisa Gutierrez 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 256 KB

By generalizing the idea of extended triangle of a graph, we succeed in obtaining a common framework for the result of Roberts and Spencer about clique graphs and the one of Szwarcÿter about Helly graphs. We characterize Helly and 3-Helly planar graphs using extended triangles. We prove that if a pl

The chvátal-erdo˝s condition for cycles
The chvátal-erdo˝s condition for cycles in triangle-free graphs
✍ Dingjun Lou 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 235 KB

It is proved that if G is a triangle-free graph with v vertices whose independence number does not exceed its connectivity then G has cycles of every length n for 4: /2 or G is a 5-cyde. This was conjectured by Amar, Fournier and Germa. All graphs considered are finite, undirected and simple. A gra