On a problem of Erdős and Rothschild on edges in triangles

DOI10.1007/s00493-012-2844-3zbMath1299.05183arXiv1106.0290OpenAlexW1994700616MaRDI QIDQ2448958

Jacob Fox, Po-Shen Loh

Publication date: 5 May 2014

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

bookstrianglesbooksize

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

Minimum degree and the graph removal lemma ⋮ Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new proof of the graph removal lemma
• On a theorem of Rademacher-Turán
• Problems and results in combinatorial analysis and graph theory
• Extremal problems and generalized degrees
• Books in graphs
• Large generalized books are \(p\)-good
• A note on Ramsey numbers for books
• On ramsey numbers for books
• Large K_r‐free subgraphs in K_s‐free graphs and some other Ramsey‐type problems
• Book Ramsey Numbers and Quasi-Randomness
• Book Ramsey numbers. I

This page was built for publication: On a problem of Erdős and Rothschild on edges in triangles