Supersaturation of Even Linear Cycles in Linear Hypergraphs

@inproceedings{Jiang2017SupersaturationOE,
  title={Supersaturation of Even Linear Cycles in Linear Hypergraphs},
  author={Tao Jiang and Liana Yepremyan},
  year={2017}
}
A classic result of Erdős and, independently, of Bondy and Simonovits [3] says that the maximum number of edges in an n-vertex graph not containing C2k, the cycle of length 2k, is O(n1+1/k). Simonovits established a corresponding supersaturation result for C2k’s, showing that there exist positive constants C, c depending only on k such that every n-vertex… CONTINUE READING