Claims

../

2001_07_01_haxell: Haxell (Combin. Probab. Comput. 2001) proves the independent-transversal bound that settles the 1975 conjecture of Bollobás, Erdős and Szemerédi; refereed and named by the site's curator as the proof.

2006_01_01_haxell_szabo: Haxell and Szabó (Combin. Probab. Comput. 2006) determine the sharp minimum-degree threshold for a complete r-vertex subgraph of an r-partite graph, below (r − 3/2)n for every r and n; refereed and named by the site.

---