theorem that an 𝑛-vertex graph that does not have a simple cycle of length 2𝑘 can only have O(𝑛¹⁺¹ᐟᵏ) edges