𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Forest embeddings in regular graphs of large girth

✍ Scribed by D.G Kirkpatrick; D.G Corneil


Book ID
107884139
Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
767 KB
Volume
30
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the bipartite density of regular grap
✍ OndΕ™ej ZΓ½ka πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 154 KB πŸ‘ 1 views

## Abstract Let __B(G)__ be the edge set of a bipartite subgraph of a graph __G__ with the maximum number of edges. Let __b~k~__ = inf{|__B(G)__|/|__E(G)__β€–__G__ is a cubic graph with girth at least __k__}. We will prove that lim~k β†’ ∞~ __b~k~__ β‰₯ 6/7.

Edges in graphs with large girth
✍ R. D. Dutton; R. C. Brigham πŸ“‚ Article πŸ“… 1991 πŸ› Springer Japan 🌐 English βš– 365 KB
Topological Minors in Graphs of Large Gi
✍ 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

Dense Minors In Graphs Of Large Girth
✍ Reinhard Diestel; Christof Rempel πŸ“‚ Article πŸ“… 2004 πŸ› Springer-Verlag 🌐 English βš– 153 KB