activity
20082012
most citedAn improved upper bound on the length of the longest cycle of a supercritical random graph

3 citations · 3 across the 3 of their papers we have counts for

collaborators
Showing 2012Show all

1 paper · 1 filter

math.CO2012

Towards a weighted version of the Hajnal-Szemerédi Theorem

József Balogh, Graeme Kemkes, Choongbum Lee +1

For a positive integer r>=2, a K_r-factor of a graph is a collection vertex-disjoint copies of K_r which covers all the vertices of the given graph. The celebrated theorem of Hajna…