Premium
Embedding Partial k ‐Star Designs
Author(s) -
Hoffman D. G.,
Roberts Dan
Publication year - 2014
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.21353
Subject(s) - mathematics , embedding , star (game theory) , combinatorics , bipartite graph , graph , decomposition , discrete mathematics , computer science , chemistry , mathematical analysis , organic chemistry , artificial intelligence
Abstract A k ‐star is the complete bipartite graph K 1 , k . Let G and H be graphs, and let B be a partial H ‐decomposition of G . A partial H ‐decomposition, B ′ , of another graph G ′ is called an embedding of B provided that B ⊆ B ′and G is a subgraph of G ′ . We find an embedding of a partial k ‐star decomposition of K n into a k ‐star decomposition of K n + s , where s is at most 7 k − 4 if k is odd, and 8 k − 4 if k is even.