The bipartite extremal-separation conjecture
Let be a bipartite graph, let denote the maximum running time of the -process, and let be the Turán extremal number of . Bipartite extremal-separation conjecture. For every bipartite graph ,
The conjecture is motivated by the gap between known lower bounds for bipartite infection rules and extremal-number upper bounds. The paper notes that an even stronger polynomial separation might hold, but that stronger claim is not included here.
References
2 papers in this index state this conjecture (2025–2026). The statement above is taken from the most recent of them; the others are arXiv:2508.03835.
Source: David Fabian, Patrick Morris and Tibor Szabó, “Graph bootstrap percolation – a discovery of slowness”, arXiv:2602.12736 (2026).
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
No solutions have been posted yet.