Combinatorics Probability Computing · 2016 · 62 citations · 18 references
Graph MinorGeometric Graph TheoryGraph TheoryAlgebraic Graph TheoryStructural Graph TheoryTopological Graph TheoryExtremal Graph TheoryPlanar GraphLength 2Network AnalysisEducationComputational ComplexityDiscrete MathematicsN -Vertex GraphFixed K
We show that, for each fixed k , an n -vertex graph not containing a cycle of length 2 k has at most $80\sqrt{k\log k}\cdot n^{1+1/k}+O(n)$ edges.
18
Extremal problems in graph theory
Christopher M. Hartman · 1997 · 236 citations
The Moore Bound for Irregular Graphs
Shlomo Hoory, Nathan Linial · Graphs and Combinatorics · 2002 · 200 citations