Kohayakawa–Nagle–Rödl–Schacht forcing conjecture
Kohayakawa–Nagle–Rödl–Schacht forcing conjecture
A graph is -locally dense if every set with satisfies . A graph is KNRS-forcing if, for every , there exist such that every -locally dense graph satisfies , unless is -quasirandom.
Kohayakawa–Nagle–Rödl–Schacht forcing conjecture. If is not a forest, then is KNRS-forcing.
This strengthens the Kohayakawa–Nagle–Rödl–Schacht conjecture by asserting that the only locally dense graphs asymptotically attaining the lower bound are quasirandom. The source does not state its resolution status.
Sources & referencesView supporting material
Primary source
Domagoj Bradač, Benny Sudakov and Yuval Wigderson, “Counting subgraphs in locally dense graphs”, arXiv:2406.12418 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.