A further extension of Rödl's theorem

DOI10.37236/11580zbMath1519.05170arXiv2208.07483WikidataQ122638731 ScholiaQ122638731MaRDI QIDQ6133166

Tung H. Nguyen

Publication date: 18 August 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Density (toughness, etc.) (05C42)

Related Items (1)

Strengthening Rödl's theorem

Cites Work

• Unnamed Item
• Ramsey-type theorems
• On universality of graphs with uniformly distributed edges
• The Erdös-Hajnal Conjecture-A Survey
• Edge Distribution of Graphs with Few Copies of a Given Graph
• The Algorithmic Aspects of the Regularity Lemma
• The Induced Removal Lemma in Sparse Graphs
• Probability Inequalities for Sums of Bounded Random Variables
• Induced Ramsey-type theorems
• Efficient testing of large graphs
• Holes in graphs
• Erdős–Hajnal for graphs with no 5‐hole

This page was built for publication: A further extension of Rödl's theorem