Timeline for The maximum number of edges in an even-cycle-free graph with $n$ vertices
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 10, 2017 at 0:00 | vote | accept | user173856 | ||
| Jun 25, 2017 at 21:11 | comment | added | domotorp | This problem can be found in L. Lovasz, Combinatorial Problems and Exercises, 10.1. | |
| Jun 25, 2017 at 20:32 | history | edited | Tony Huynh |
edited tags
|
|
| Jun 25, 2017 at 16:53 | comment | added | Jon Noel | Tony's argument below should answer your question. It's also worth mentioning that the problem of maximizing the number of edges in a graph forbidding an even cycle of fixed length is well studied (see, e.g., the Bondy-Simonovits Theorem). | |
| Jun 24, 2017 at 19:06 | answer | added | Tony Huynh | timeline score: 11 | |
| Jun 24, 2017 at 18:45 | history | asked | user173856 | CC BY-SA 3.0 |