Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree

DOI10.1017/S0963548316000328zbMath1371.05146arXiv1404.7764MaRDI QIDQ5366947

Guillem Perarnau, Bruce A. Reed

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.7764

zbMATH Keywords

bipartite graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Degree Ramsey numbers for even cycles ⋮ Counting hypergraphs with large girth ⋮ Random polynomial graphs for random Turán problems ⋮ Decomposition of bounded degree graphs into \(C_4\)-free subgraphs ⋮ Relative Turán Problems for Uniform Hypergraphs ⋮ Relative Turán numbers for hypergraph cycles ⋮ Inverse Turán numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Short proofs of some extremal results. II.
• Girth in graphs
• Polarities and \(2k\)-cycle-free graphs
• Norm-graphs: Variations and applications
• A note on graphs without short even cycles
• Every graph of sufficiently large average degree contains a \(C_4\)-free subgraph of large average degree
• On a conjecture of Thomassen
• Norm-graphs and bipartite Turán numbers
• Graph Theory and Probability
• Graph Theory and Probability. II
• Large Subgraphs without Short Cycles
• The History of Degenerate (Bipartite) Extremal Graph Problems
• Extensions of Sylvester's Theorem
• On a problem of K. Zarankiewicz
• Graph colouring and the probabilistic method

This page was built for publication: Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree