Decompositions of λ K v

C. A. Rodger () and S. K. Westbrook ()
Additional contact information
C. A. Rodger: Auburn University
S. K. Westbrook: Auburn University

Journal of Combinatorial Optimization, 2007, vol. 14, issue 2, No 15, 259-265

Abstract: Abstract In a series of 2 papers, Kang, Du and Tian solved the existence problem for G-decomposition of λ K n when G is any simple graph with 6 vertices and 7 edges, except when G is the graph T=K 4∪K 2. Notice that a T-decomposition can be considered to be a Pairwise Balanced Design in which each block of size 4 has been matched to a block of size 2. In this paper we remove this exception for all λ≥2. The case when λ=1 is also addressed.

Keywords: Graph decompositions; Pairwise balanced designs (search for similar items in EconPapers)
Date: 2007
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9056-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:14:y:2007:i:2:d:10.1007_s10878-007-9056-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-007-9056-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().