Prefer a chat interface with context about you and your work?
Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree
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 …