1 Answers
In extremal graph theory, the even circuit theorem is a result of Paul Erdős according to which an n-vertex graph that does not have a simple cycle of length 2k can only have O edges. For instance, 4-cycle-free graphs have O edges, 6-cycle-free graphs have O edges, etc.
4 views
Answered