scientific article; zbMATH DE number 3505018
From MaRDI portal
Publication:4085755
[For the entire collection see Zbl 0307.00009.] Necessary conditions on \((n,k,l)\) are given for the possibility to partition the edges of a complete graph \(K_n\) into isomorphic copies of a connected subgraph \(G_{k,t}\) with \(k\) vertices and \(l\) edges. It is conjectured that these conditions are sufficient if \(n\) is large. This conjecture is proved for \(k=2,3\), and 4.
Recommendations
Cited in
(10)- \(G\)-decomposition of \(K_n\), where G has four vertices or less
- A graph partition problem
- Edge-decompositions ofKn,ninto isomorphic copies of a given tree
- Almost regular edge colorings and regular decompositions of complete graphs
- scientific article; zbMATH DE number 3813668 (Why is no real title available?)
- scientific article; zbMATH DE number 1146226 (Why is no real title available?)
- scientific article; zbMATH DE number 1996256 (Why is no real title available?)
- COMMON MULTIPLES OF COMPLETE GRAPHS
- Decompositions of Complete Graphs
- On edge decompositions of a complete graph into smaller complete graphs.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4085755)