\(H\)-packing of \(k\)-chromatic graphs (Q1937363)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: \(H\)-packing of \(k\)-chromatic graphs |
scientific article; zbMATH DE number 6140078
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(H\)-packing of \(k\)-chromatic graphs |
scientific article; zbMATH DE number 6140078 |
Statements
\(H\)-packing of \(k\)-chromatic graphs (English)
0 references
28 February 2013
0 references
Let \(H\) and \(G\) be graphs, and let \(p_H(G)\) denote the maximum number of edges covered by a set of edge-disjoint copies of \(H\) in \(G\). In this paper, the author consider the problem of edge-packing and determine the relationship between \(p_H(G)\) and \(p_{K_k}(G)\) where \(H\) is \(k\)-chromatic. Moreover, the author also gave some applications of the result in extremal graph theory.
0 references
edge-packing
0 references
chromatic number
0 references
\(H\)-packing
0 references
