Highly Influenced

# 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} }

- Published 1992 in Graphs and Combinatorics
DOI:10.1007/BF02350627

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

#### Referenced Papers

##### Publications referenced by this paper.

Showing 1-4 of 4 references

Highly Influential

Highly Influential

Highly Influential