Subgraph densities in \(K_r\)-free graphs
From MaRDI portal
Publication:2699640
DOI10.37236/11329OpenAlexW4360849062MaRDI QIDQ2699640
Andrzej Grzesik, Casey Tompkins, Nika Salia, Ervin Gyoeri
Publication date: 19 April 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.13455
Related Items (1)
Cites Work
- On the maximum number of five-cycles in a triangle-free graph
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs
- On the number of pentagons in triangle-free graphs
- On Turán-good graphs
- Maximizing five-cycles in \(K_r\)-free graphs
- Counting copies of a fixed subgraph in \(F\)-free graphs
- Many \(T\) copies in \(H\)-free graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: Subgraph densities in \(K_r\)-free graphs