Smaller embeddings of partial $k$-star decompositions
From MaRDI portal
Publication:6378755
DOI10.37236/10759arXiv2109.13475MaRDI QIDQ6378755
Ajani De Vas Gunasekara, Daniel Horsley
Publication date: 28 September 2021
Abstract: A -star is a complete bipartite graph . For a graph , a -star decomposition of is a set of -stars in whose edge sets partition the edge set of . If we weaken this condition to only demand that each edge of is in at most one -star, then the resulting object is a partial -star decomposition of . An embedding of a partial -star decomposition of a graph is a partial -star decomposition of another graph such that and is a subgraph of . This paper considers the problem of when a partial -star decomposition of can be embedded in a -star decomposition of for a given integer . We improve a result of Noble and Richardson, itself an improvement of a result of Hoffman and Roberts, by showing that any partial -star decomposition of can be embedded in a -star decomposition of for some such that when is odd and when is even. For general , these constants cannot be improved. We also obtain stronger results subject to placing a lower bound on .
Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph designs and isomorphic decomposition (05C51)
This page was built for publication: Smaller embeddings of partial $k$-star decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6378755)