A counterexample to sparse removal

DOI10.1016/j.ejc.2014.09.008zbMath1302.05089arXiv1312.2994WikidataQ124840434 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 sets; bipartite graphs

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

05C42: Density (toughness, etc.)

Related Items

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

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