Schelp's dense-subgraph conjecture for Ramsey paths
Let denote the path with vertices, and let be a graph on vertices. Schelp's conjecture. If is sufficiently large and
then arrows , meaning that every -edge-coloring of contains a monochromatic copy of . This is the dense-host analogue of the equality ; the supplied text says that only an asymptotic version had been proved at this point.
References
- József Balogh, Alexandr Kostochka, Mikhail Lavrov and Xujun Liu, “Monochromatic paths and cycles in 2-edge-colored graphs with large minimum degree”, arXiv:1906.02854 (2021).
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.