arXiv Analytics

Sign in

arXiv:2011.11064 [math.CO]AbstractReferencesReviewsResources

Extremal numbers of cycles revisited

David Conlon

Published 2020-11-22Version 1

We give a simple geometric interpretation of an algebraic construction of Wenger that yields $n$-vertex graphs with no cycle of length $4$, $6$ or $10$ and close to the maximum number of edges.

Comments: 3 pages, to appear in Amer. Math. Monthly
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1205.6847 [math.CO] (Published 2012-05-30)
On the Maximum Number of Edges in a Hypergraph with Given Matching Number
arXiv:math/0601767 [math.CO] (Published 2006-01-31)
Empty Rectangles and Graph Dimension
arXiv:1207.0996 [math.CO] (Published 2012-07-04, updated 2015-02-10)
The maximum number of intersections of two polygons

Links

Toolbox