Subquadratic conjecture for odd cycles with an additional forbidden odd cycle
Let be positive integers, and let denote the maximum number of copies of in an -vertex graph containing no copy of any graph in .
Subquadratic odd-cycle conjecture. There exists an such that
The source proves only a quadratic upper bound for this generalized Turán number and conjectures a power saving below . The question concerns how strongly forbidding an additional odd cycle reduces the number of copies of an odd cycle.
References
- Dániel Gerbner, Ervin Győri, Abhishek Methuku and Máté Vizer, “Generalized Turán problems for even cycles”, arXiv:1712.07079 (2018).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.