✦ LIBER ✦

On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs

✍ Scribed by Razborov, Alexander A.

Book ID: 120529193
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 561 KB
Volume: 74
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.21707

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Caccetta–Häggkvist Conjecture

✍ Jian Shen 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 118 KB

Counting subgraphs a new approach to the

Counting subgraphs a new approach to the Caccetta-Häggkvist conjecture

✍ J.A. Bondy 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 552 KB

Total domination and the Caccetta–Häggkv

Total domination and the Caccetta–Häggkvist conjecture

✍ Patrick St-Louis; Bernard Gendron; Alain Hertz 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 283 KB

Proof of the Caccetta–Häggkvist conjectu

Proof of the Caccetta–Häggkvist conjecture for oriented graphs with positive minimum out-degree and of independence number two

✍ Lichiardopol, Nicolas 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 336 KB

On planar intersection graphs with forbi

On planar intersection graphs with forbidden subgraphs

✍ János Pach; Micha Sharir 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

## Abstract Let ${\cal C}$ be a family of __n__ compact connected sets in the plane, whose intersection graph $G({\cal C})$ has no complete bipartite subgraph with __k__ vertices in each of its classes. Then $G({\cal C})$ has at most __n__ times a polylogarithmic number of edges, where the exponent

On Universal Graphs With Forbidden Topol

On Universal Graphs With Forbidden Topological Subgraphs

✍ Diestel, Reinhard 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 490 KB