Density theorems for bipartite graphs and related Ramsey-type results

2009/03/01 by Jacob Fox, Benny Sudakov · 3 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Advanced Topology and Set Theory #Bipartite graph #Cograph #Combinatorics #Dense graph #Discrete mathematics #Extremal graph theory #Graph #Intersection graph #Limits and Structures in Graph Theory #Line graph #Mathematical proof #Mathematics #Pathwidth #Ramsey theory #Ramsey's theorem #Triangle-free graph #Voltage graph

paper · doi:10.1007/s00493-009-2475-5

crossref issued 2009/03/01 · crossref published 2009/03/01 · crossref published-print 2009/03/01 · openalex publication_date 2009/03/01 · crossref published-online 2009/06/24 · crossref created 2019/12/11 · crossref deposited 2019/12/11 · openalex created_date 2025/10/10 · crossref indexed 2026/07/13 · openalex updated_date 2026/07/29

Citations

• On a problem of K. Zarankiewicz
• A Combinatorial Problem in Geometry
• A new upper bound for diagonal Ramsey numbers
• Some remarks on the theory of graphs
• Induced Ramsey Numbers
• On a Problem of Formal Logic
• The primes contain arbitrarily long arithmetic progressions
• Induced Ramsey-type theorems

Cited by

• A note on induced Ramsey numbers
• Ramsey-type problem for an almost monochromatic K₄
• Two remarks on the Burr–Erdős conjecture
• Ramsey's theorem [wikipedia]