Turán numbers of bipartite graphs plus an odd cycle
From MaRDI portal
Publication:402594
DOI10.1016/j.jctb.2014.01.007zbMath1297.05124arXiv1210.3805OpenAlexW2143122465MaRDI QIDQ402594
Publication date: 28 August 2014
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.3805
Related Items
Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko, Planar polynomials and an extremal problem of Fischer and Matoušek, On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\), Bipartite-ness under smooth conditions, Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle, Independent Sets in Polarity Graphs, On the chromatic number of the Erdős-Rényi orthogonal polarity graph, The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition, Density of balanced 3-partite graphs without 3-cycles or 4-cycles, The regularity method for graphs with few 4‐cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sur la trialité et certains groupes qui s'en déduisent
- Norm-graphs: Variations and applications
- Explicit Ramsey graphs and orthonormal labelings
- Compactness results in extremal graph theory
- New asymptotics for bipartite Turán numbers
- Dense \(H\)-free graphs are almost \((\chi (H)-1)\)-partite
- On a conjecture of Erdős and Simonovits: even cycles
- Extremal results in sparse pseudorandom graphs
- On a valence problem in extremal graph theory
- Norm-graphs and bipartite Turán numbers
- Szemerédi's Regularity Lemma for Matrices and Sparse Graphs
- Szemerédi’s Regularity Lemma for Sparse Graphs
- An Upper Bound on Zarankiewicz' Problem
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
- On the structure of linear graphs
