Year: 2025
Type: article
Abstract: ABSTRACT A ‐star is a complete bipartite graph . A partial ‐star design of order is a pair where is a set of vertices and is a set of edge‐disjoint ‐stars whose vertex sets are subsets of . If each edge of the complete graph with vertex set is in some star in , then is a (complete) ‐star design. We say that is completable if there is a ‐star design such that . In this paper we determine, for all and , the minimum number of stars in an uncompletable partial ‐star design of order .
Source: Journal of Combinatorial Designs
DOI: 10.1002/jcd.22003
Authors: Ajani De Vas Gunasekara, Daniel Horsley
Institutions: The University of Notre Dame Australia, Monash University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,350
OpenAlex ID: W4413296095