A note on the decomposition of graphs into isomorphic matchings (Q790841): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: \(G\)-decomposition of \(K_n\), where G has four vertices or less / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Revision as of 11:15, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the decomposition of graphs into isomorphic matchings |
scientific article |
Statements
A note on the decomposition of graphs into isomorphic matchings (English)
0 references
1983
0 references
A graph G is said to have an H-decomposition if it is the union of pairwise edge-disjoint subgraphs, each isomorphic to H. The graph \(tK_ 2\) is the graph consisting of t independent edges. For a graph G to have a \(tK_ 2\) decomposition it is clearly necessary that \(t| e(G)\) and \(\Delta(G)\leq e(G)| t.\) In this note the author shows that for graphs with more than (8/3) \(t^ 2-2t\) edges, these conditions are also sufficient.
0 references
decomposition
0 references
disjoint matchings
0 references
edge-disjoint subgraphs
0 references
