Extremal problems for cycles in graphs

By Jacques Verstraëte. 2016

77 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/7eee381dadc086dbc9dd3acff9296b74bcbdc255

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. Richard Montgomery
2. Hong Liu
3. Sam Mattheus
4. Jacques Verstraëte

In Discrete Mathematics and Combinatorics

1. Richard Montgomery
2. Hong Liu
3. Sam Mattheus
4. Jacques Verstraëte

In Geometry and Topology

1. Richard Montgomery
2. Hong Liu
3. Sam Mattheus
4. Jacques Verstraëte
5. Davide Barilari
6. B. Warhurst
7. Nathaniel Eldredge
8. Andrei A. Agrachev

Citations in the corpus

• The asymptotics of r(4,t) (2023, background): “A survey of extremal problems for cycles in graphs is given in [56].”
• A solution to Erd\H{o}s and Hajnal's odd cycle problem (2020, methodology): “Indeed, the only relevant result towards this has been by Sudakov and Verstraëte [19], who showed that ∑ `∈Codd(G) 1/`→∞ if the independence ratio of G is not extremely small compared to its number of vertices.”