Abstract
We discuss degree conditions for finding many disjoint copies of a fixed graph H in a large graph G.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 203-218 |
| Number of pages | 16 |
| Journal | Combinatorica |
| Volume | 20 |
| Issue number | 2 |
| DOIs | |
| State | Published - 2000 |
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Computational Mathematics