A counterexample to sparse removal

DOI10.1016/j.ejc.2014.09.008zbMath1302.05089arXiv1312.2994OpenAlexW2089062285WikidataQ124840434 ScholiaQ124840434MaRDI QIDQ472399

Craig Timmons, Jacques Verstraete

Publication date: 19 November 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Sidon setsbipartite graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)

Related Items (9)

Planar polynomials and an extremal problem of Fischer and Matoušek ⋮ On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\) ⋮ Counting hypergraphs with large girth ⋮ Improved lower bounds for multiplicative square-free sequences ⋮ Sparse Hypergraphs with Applications to Coding Theory ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Unnamed Item ⋮ Relative Turán numbers for hypergraph cycles ⋮ Generalized Turán problems for complete bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• On hypergraphs of girth five
• Compactness results in extremal graph theory
• New asymptotics for bipartite Turán numbers
• Graph removal lemmas
• Dependent random choice
• Solving a linear equation in a set of integers I
• Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
• On Certain Sets of Integers
• On a problem of K. Zarankiewicz

This page was built for publication: A counterexample to sparse removal