Turán number conjecture for Cartesian products of trees
Let and be trees, each with at least one edge, and let denote their Cartesian product. For a positive integer , let be the maximum number of edges in a -free graph on vertices. Cartesian-product conjecture. There exist positive real numbers and such that
The product is -degenerate, and the conjecture is motivated in part by Erdős's conjecture on Turán numbers of degenerate bipartite graphs. Its general validity remains open.
References
- Domagoj Bradač, Oliver Janzer, Benny Sudakov and István Tomon, “The Turán number of the grid”, arXiv:2203.05485 (2022).
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.