Name
Abstract | ||
|---|---|---|
We say that a graph G has a perfect H-packing if there exists a set of vertex-disjoint copies of H which cover all the vertices in G. We consider various problems concerning perfect H-packings: Given n, r, D is an element of N, we characterise the edge density threshold that ensures a perfect K-r-packing in any graph G on n vertices and with minimum degree delta(G) >= D. We also give two conjectures concerning degree sequence conditions which force a graph to contain a perfect H-packing. Other related embedding problems are also considered. Indeed, we give a structural result concerning K-r-free graphs that satisfy a certain degree sequence condition. |
Year | Venue | Keywords |
|---|---|---|
2013 | ELECTRONIC JOURNAL OF COMBINATORICS | degree sequence |
Field | DocType | Volume |
Adjacency matrix,Diagonal,Abelian group,Characteristic polynomial,Discrete mathematics,Combinatorics,Irreducible representation,Isomorphism,Digraph,Eigenvalues and eigenvectors,Mathematics | Journal | 20.0 |
Issue | ISSN | Citations |
1.0 | 1077-8926 | 5 |
PageRank | References | Authors |
0.53 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| József Balogh | 1 | 862 | 89.91 |
| Alexandr V. Kostochka | 2 | 682 | 89.87 |
| Andrew Treglown | 3 | 99 | 15.16 |