1 problem

Liu–Montgomery's crux conjecture. There exists some constant $c>0$ such that every graph $G$ contains a subdivision of a clique with at least