On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs

DOI10.1016/j.jctb.2007.12.003zbMath1189.05084arXiv0706.1920OpenAlexW2109728963MaRDI QIDQ947730

Jacob Fox, Benjamin Sudakov

Publication date: 7 October 2008

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

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

zbMATH Keywords

Balog-Szemerédi-Gowers theoremcycle-connected graphsdependent random choice

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Related Items (1)

Dependent random choice

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycle-connected graphs
• A new proof of Szemerédi's theorem for arithmetic progressions of length four
• A statistical theorem of set addition
• A few remarks on Ramsey--Turán-type problems
• On a question of Erdős and Moser
• On graphs with small Ramsey numbers*
• On large intersecting subfamilies of uniform setfamilies
• Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
• On Ramsey Numbers of Sparse Graphs
• Large K_r‐free subgraphs in K_s‐free graphs and some other Ramsey‐type problems
• Minimal Regular Graphs of Girths Eight and Twelve

This page was built for publication: On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs