The Doyen–Wilson theorem for bull designs

Autor:	Yuan-Lung Lin, Yu-Fong Hsu, Chin-Mei Fu, Shu-Wen Lo, Wen-Chung Huang
Rok vydání:	2013
Předmět:	Combinatorics Discrete mathematics ComputingMilieux_MANAGEMENTOFCOMPUTINGANDINFORMATIONSYSTEMS Wilson's theorem Ordered pair Discrete Mathematics and Combinatorics Graph MathematicsofComputing_DISCRETEMATHEMATICS Theoretical Computer Science Vertex (geometry) Mathematics
Zdroj:	Discrete Mathematics. 313:498-507
ISSN:	0012-365X
DOI:	10.1016/j.disc.2012.11.023
Popis:	A bull is a graph which is obtained by attaching two edges to two vertices of a triangle. A bull-design of order n is an ordered pair ( X , A ) , where X is the vertex set of K n and A is an edge-disjoint decomposition of K n into copies of bulls. In this paper, it is shown that a bull-design of order n can be embedded in a bull-design of order m if and only if m ≥ 3 n / 2 + 1 or m = n . This produces a generalization of the Doyen–Wilson theorem for bull-designs.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a577be001817491c8078beed34a09639 https://doi.org/10.1016/j.disc.2012.11.023 Zobrazit plný text záznamu Full Text from ScienceDirect