The minimum degree removal lemma thresholds

DOI10.1016/j.jctb.2024.01.003arXiv2301.13789MaRDI QIDQ6196159

Lior Gishboliner, Zhihan Jin, Benjamin Sudakov

Publication date: 14 March 2024

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

removal lemmaminimum degree threshold

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new proof of the graph removal lemma
• On the chromatic number of \(H\)-free graphs of large minimum degree
• Homomorphism thresholds for odd cycles
• On the structure of triangle-free graphs of large minimum degree
• On the chromatic number of triangle-free graphs of large minimum degree
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• Triangle-free four-chromatic graphs
• The chromatic thresholds of graphs
• On extremal problems of graphs and generalized graphs
• On the chromatic number of pentagon-free graphs of large minimum degree
• On a valence problem in extremal graph theory
• Dense graphs with small clique number
• ODD Cycles of Specified Length in Non-Bipartite Graphs
• On the Structure of Dense Triangle-Free Graphs
• Triangle-Free Graphs with Large Degree
• Testing subgraphs in large graphs
• On the structure of Dense graphs with bounded clique number
• The homomorphism threshold of ‐free graphs
• Minimum degree and the graph removal lemma