Why Circular Order Beats Randomness at Counting Certain Cycles
A new proof shows why a balanced circular tournament beats randomness at counting cycles whose lengths are divisible by four.
extremal combinatorics
A new proof shows why a balanced circular tournament beats randomness at counting cycles whose lengths are divisible by four.