Corpus ID: 220381400

Maximizing five-cycles in Kr-free graphs

@article{Lidick2020MaximizingFI,
  title={Maximizing five-cycles in Kr-free graphs},
  author={B. Lidick{\'y} and K. Murphy},
  journal={arXiv: Combinatorics},
  year={2020}
}
The Erdos Pentagon problem asks to find an n-vertex triangle-free graph that is maximizing the number of 5-cycles. The problem was solved using flag algebras by Grzesik and independently by Hatami, Hladky, Kral, Norin, and Razborov. Recently, Palmer suggested the general problem of maximizing the number of 5-cycles in K_{k+1}-free graphs. Using flag algebras, we show that every K_{k+1}-free graph of order n contains at most \[\frac{1}{10k^4}(k^4 - 5k^3 + 10k^2 - 10k + 4)n^5 + o(n^5)\] copies of… Expand

Figures and Tables from this paper

Paths of Length Three are $K_{r+1}$-Tur\'an Good

References

SHOWING 1-10 OF 41 REFERENCES
Minimizing the number of 5-cycles in graphs with given edge-density
A problem of Erdős and Sós on 3-graphs
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
  • O. Pikhurko
  • Computer Science, Mathematics
  • Eur. J. Comb.
  • 2011
On the maximal number of certain subgraphs inKr-free graphs
Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
Supersaturation for subgraph counts
On the number of pentagons in triangle-free graphs
Pentagons in triangle-free graphs
Counting copies of a fixed subgraph in F-free graphs
Many T copies in H-free graphs
...
1
2
3
4
5
...