H-factors in dense graphs

Journal of Combinatorial Theory. Series B

Volumn 66, Issue 2, 1996, Pages 269-282

  Alon, Noga ^a   Yuster, Raphael ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030102833     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1996.0020     Document Type: Article

References (10)

1. 1. N. ALON, R. A. DUKE, H. LEFMANN, V. RÖDL, AND R. YUSTER, The algorithmic aspects of the regularity lemma, J. Algorithms 16 (1994), 80-109.
2. 2. N. ALON AND J. SPENCER, "The Probabilistic Method," Wiley, New York, 1991.
3. 3. N. ALON AND R. YUSTER, Almost H-factors in dense graphs, Graphs Combin. 8 (1992), 95-102.
4. 4. B. BOLLOBÁS, "Extremal Graph Theory," Academic Press, New York, 1978.
5. 5. K. CORRÁDI AND A. HAJNAL, On the maximum number of independent circuits in a graph, Acta Math. Acad. Sci. Hungar. 14 (1963), 423-439.
6. 6. P. ERDOS, Some recent combinatorial problems, preprint, Nov. 1990.
7. 7. A. HAJNAL AND E. SZEMERÉDI, Proof of a conjecture of Erdos, in "Combinatorial theory and Its Applications" (P. Erdos, A. Renyi, and V. T. Sós, Eds.), Vol. II, Colloquia Math. Soc. János Bolyai, Vol. 4, pp. 601-623, North-Holland, Amsterdam, 1970.
8. 8. J. KOMLÓS, G. N. SÁRKÖZY, AND E. SZEMERÉDI, Proof of a packing conjecture of Bollobás, Combinatorics, Probab. Comput. 4 (1995), 241-255.
9. 9. P. RAGHAVAN, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, J. Comput. System Sci. 37 (1988), 130-143.
10. 10. E. SZEMERÉDI, Regular partitions of graphs, in "Proc. Colloque Inter. CNRS" (J.-C. Bermond, J.-C. Fournier, M. Las Vergnas, and D. Sotteau, Eds.), pp. 399-401, CNRS, 1978.