Article contents
Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree
Published online by Cambridge University Press: 07 December 2016
Abstract
Let ℱ be a family of graphs and let d be large enough. For every d-regular graph G, we study the existence of a spanning ℱ-free subgraph of G with large minimum degree. This problem is well understood if ℱ does not contain bipartite graphs. Here we provide asymptotically tight results for many families of bipartite graphs such as cycles or complete bipartite graphs. To prove these results, we study a locally injective analogue of the question.
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2016
References
- 6
- Cited by