✦ LIBER ✦

Topological Subgraphs in Graphs of Large Girth

✍ Scribed by W. Mader

Publisher: Springer-Verlag
Year: 1998
Tongue: English
Weight: 182 KB
Volume: 18
Category: Article
ISSN: 0209-9683
DOI: 10.1007/pl00009829

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Topological Minors in Graphs of Large Gi

Topological Minors in Graphs of Large Girth

✍ Daniela Kühn; Deryk Osthus 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 204 KB

We prove that every graph of minimum degree at least r and girth at least 186 contains a subdivision of K rþ1 and that for r5435 a girth of at least 15 suffices. This implies that the conjecture of Haj ! o os that every graph of chromatic number at least r contains a subdivision of K r (which is fal

Edges in graphs with large girth

✍ R. D. Dutton; R. C. Brigham 📂 Article 📅 1991 🏛 Springer Japan 🌐 English ⚖ 365 KB

Dense Minors In Graphs Of Large Girth

✍ Reinhard Diestel; Christof Rempel 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 153 KB

Small topological complete subgraphs of

Small topological complete subgraphs of “dense” graphs

✍ A. Kostochka; L. Pyber 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 153 KB

Extraconnectivity of graphs with large g

Extraconnectivity of graphs with large girth

✍ J. Fàbrega; M.A. Fiol 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 547 KB

On a conjecture of Thomassen concerning

On a conjecture of Thomassen concerning subgraphs of large girth

✍ Domingos Dellamonica Jr; Václav Koubek; Daniel M. Martin; Vojtěch Rödl 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

In 1983 C. Thomassen conjectured that for every k, g ∈ N there exists d such that any graph with average degree at least d contains a subgraph with average degree at least k and girth at least g. Kühn and Osthus [2004] proved the case g = 6. We give another proof for the case g = 6 which is based