Refining the graph density condition for the existence of almost Kfactors, Ars Combinatorica, vol.52, pp.296-308, 1999. ,
The Probabilistic Method, 1992. ,
H-Factors in Dense Graphs, Journal of Combinatorial Theory, Series B, vol.66, issue.2, pp.269-282, 1996. ,
DOI : 10.1006/jctb.1996.0020
On the maximal number of independent circuits in a graph, Acta Mathematica Academiae Scientiarum Hungaricae, vol.14, issue.3-4, pp.423-439, 1963. ,
DOI : 10.1007/BF01895727
P 3 -factors and covering cycles in graphs of minimum degree n/3, Colloq . Math. Soc. J. Bolyai. Eger (Hungary), vol.52, 1987. ,
Proof of a conjecture of Erd? os, Combinatorial Theory and its Applications, 1970. ,
K ? 4 -factors in a graph, J. Graph Theory, vol.39, pp.111-128, 2002. ,
Critical chromatic number and the complexity of perfect packings in graphs ,
Tiling Tur??n Theorems, Combinatorica, vol.20, issue.2, pp.203-218, 2000. ,
DOI : 10.1007/s004930070020
Blow-up Lemma, Combinatorica, vol.9, issue.1, pp.109-123, 1997. ,
DOI : 10.1007/BF01196135
Proof of the Alon???Yuster conjecture, Discrete Mathematics, vol.235, issue.1-3, pp.255-269, 2001. ,
DOI : 10.1016/S0012-365X(00)00279-X
Proof of a tiling conjecture of Koml??s, Random Structures & Algorithms, vol.235, issue.1-3, pp.180-205, 2003. ,
DOI : 10.1002/rsa.10091