On the Turán number for the hexagon

By Z. Furedi, Assaf Naor, Jacques Verstraëte. 2006

67 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/1b5acfd5a571428dbd609f20fff68c9e4de3357c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Jacques Verstraëte
2. Robert Morris
3. David Saxton
4. Miklós Simonovits
5. Z. Furedi
6. Assaf Naor
7. Peter Keevash
8. Sam Mattheus

In Discrete Mathematics and Combinatorics

1. Jacques Verstraëte
2. Robert Morris
3. David Saxton
4. Z. Furedi
5. Assaf Naor
6. Miklós Simonovits
7. Peter Keevash
8. Sam Mattheus

In Geometry and Topology

1. Jacques Verstraëte
2. Robert Morris
3. David Saxton
4. Miklós Simonovits
5. Z. Furedi
6. Assaf Naor
7. Sam Mattheus
8. Wojciech Samotij

Citations in the corpus

• The number of $C_{2l}$-free graphs (2013, methodology): “Erdős and Simonovits conjectured (see [15] or [24]) that this bound is sharp up to the implied constant factor, but matching lower bounds are known only for C4 = K2,2 (see above), C6 and C10 (see [9, 26, 36, 47]).”
• Extremal problems for cycles in graphs (2016, background): “In the case of hexagons, Füredi, Naor and the author [58] proved the following theorem:”
• The History of Degenerate (Bipartite) Extremal Graph Problems (2013, background): “On the other hand, Füredi, Naor and Verstaëte [117] showed that if we exclude only C2k, then ex(n,C6) > 0.”
• A Note on Bipartite Graphs Without 2k-Cycles (2005, background): “The flrst inequality comes from [ 8 ] and the second inequality is implicit in the work of”