Forest deletion conjecture for maximum 2-density
For a graph , let denote its maximum average density, and let denote its maximum -density. Forest deletion conjecture. There exists a forest such that
This conjecture is proposed as an independent statement whose resolution would imply the Kohayakawa–Kreuter conjecture in all cases.
References
Primary source
Eden Kuperwasser, Wojciech Samotij and Yuval Wigderson, “On the Kohayakawa-Kreuter conjecture”, arXiv:2307.16611 (2023).
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.