Skip to main content
SpringerLink
Log in

AlmostH-factors in dense graphs

  • Original Papers
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

The following asymptotic result is proved. For every fixed graphH withh vertices, any graphG withn vertices and with minimum degree\(d \geqslant \frac{{\chi (H) - 1}}{{\chi (H)}}n\) contains (1−o(1))n/h vertex disjoint copies ofH.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, London: Macmillan Press 1976

    Google Scholar 

  2. Corrádi, K., Hajnal, A.: On the maximal number of independent circuits in a graph. Acta Math. Acad. Sci. Hungar.14 423–439 (1963)

    Article  MathSciNet  Google Scholar 

  3. Erdös, P.: Some recent combinatorial problems, November 1990 (preprint)

  4. Hajnal, A., Szemerédi, E.: Proof of a conjecture of Erdös. In: Combinatorial Theory and its Applications, Vol. II (P. Erdös, A Renyi and V.T. Sós eds.), Colloq. Math. Soc. J. Bolyai 4, pp. 601–623. Amsterdam: North Holland 1970

    Google Scholar 

  5. Szemerédi, E.: 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, 1978

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel

    Noga Alon & Raphael Yuster

Authors
  1. Noga Alon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Raphael Yuster
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported in part by a United States Israel BSF Grant and by a Bergmann Memorial Grant

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alon, N., Yuster, R. AlmostH-factors in dense graphs. Graphs and Combinatorics 8, 95–102 (1992). https://doi.org/10.1007/BF02350627

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02350627

Keywords

Search

Navigation