Long‐Tu Yuan

Strong counterexamples to a supersaturation question of Ma–Yuan

For a graph 𝐹 , let ℎ 𝐹 ⁡ ( 𝑛 , 𝑞 ) be the minimum number of copies of 𝐹 in an 𝑛 -vertex graph with e x ⁡ ( 𝑛 , 𝐹 ) + 𝑞 edges, where e x ⁡ ( 𝑛 , 𝐹 ) is the maximum number of edges in an 𝑛 -vertex 𝐹 -free graph. Let 𝑐 ⁡ ( 𝑛 , 𝐹 ) be the minimum number of copies obtained by adding...