Subdivisions of graphs with large minimum degree
Author:
- 1 March 1984
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 8 (1) , 23-28
Abstract
We prove a theorem on path systems implying the conjecture of Bollobás that there exists a function f(k, m) (where k and m are natural numbers) satisfying the following: For each graph G of minimum degree at least f(k, m) there exists a graph H of minimum degree at least k such that G contains the graph obtained from H by subdividing each edge m times.Keywords
This publication has 4 references indexed in Scilit:
- Graph decomposition with applications to subdivisions and path systems modulo kJournal of Graph Theory, 1983
- Cycles and semi-topological configurationsLecture Notes in Mathematics, 1978
- Cycles Modulo kBulletin of the London Mathematical Society, 1977
- Existenz gewisser Konfigurationen inn-gesättigten Graphen und in Graphen genügend großer KantendichteMathematische Annalen, 1971