AlmostH-factors in dense graphs

@article{Alon1992AlmostHfactorsID,
  title={AlmostH-factors in dense graphs},
  author={Noga Alon and Raphael Yuster},
  journal={Graphs and Combinatorics},
  year={1992},
  volume={8},
  pages={95-102}
}
The following asymptotic result is proved. For every fixed graph H with h vertices, any graph G with n vertices and with minimum degree d ≥ χ(H)−1 χ(H) n contains (1− o(1))n/h vertex disjoint copies of H. ∗Research supported in part by a United States Israel BSF Grant and by a Bergmann Memorial Grant 

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
29 Extracted Citations
4 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-4 of 4 references

Regular partitions of graphs

  • E. Szemerédi
  • in: Proc. Colloque Inter. CNRS (J. -C. Bermond, J…
  • 1978
Highly Influential
7 Excerpts

Some recent combinatorial problems

  • P. Erdös
  • 1990
Highly Influential
4 Excerpts

Proof of a conjecture of Erdös, in: Combinatorial Theory and its Applications, Vol. II (P. Erdös, A

  • A. Hajnal, E. Szemerédi
  • Renyi and V. T. Sós eds.), Colloq. Math. Soc. J…
  • 1970
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…