Published May 28, 2021
| Submitted
Journal Article
Open
Extremal Numbers of Cycles Revisited
- Creators
-
Conlon, David
Abstract
We give a simple geometric interpretation of an algebraic construction of Wenger that gives n-vertex graphs with no cycle of length 4, 6, or 10 and close to the maximum number of edges.
Additional Information
© 2021 The Mathematical Association of America. Received 09 May 2020, Accepted 22 Nov 2020, Published online: 27 Apr 2021.Attached Files
Submitted - 2011.11064.pdf
Files
2011.11064.pdf
Files
(79.4 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:3a815f033560f626df06d5b194239212
|
79.4 kB | Preview Download |
Additional details
- Eprint ID
- 109345
- Resolver ID
- CaltechAUTHORS:20210602-132638631
- Created
-
2021-06-02Created from EPrint's datestamp field
- Updated
-
2021-06-02Created from EPrint's last_modified field