Perfect T(G) triple systems when G is a matching

Manzer, Joshua Daniel Adrian (2008) Perfect T(G) triple systems when G is a matching. Masters thesis, Memorial University of Newfoundland.

[img] [English] PDF - Accepted Version
Available under License - The author retains copyright ownership and moral rights in this thesis. Neither the thesis nor substantial extracts from it may be printed or otherwise reproduced without the author's permission.

Download (5MB)


A T(G) triple is formed by taking a graph G and replacing every edge with a 3-cycle, where all of the new vertices are distinct from all others in G. An edge-disjoint decomposition of 3Kn into T(G) triples is called a T(G) triple system of order n. If we can decompose Kn into copies of a graph G, such that we can form a T(G) triple from each graph in the decomposition and produce a partition of the edges of 3Kn, then the resulting T(G) triple system is called perfect. -- We give necessary and sufficient conditions for the existence of perfect T(G) triple systems when G is a matching with λ edges, which we denote by ⋃λP₂. We then give cyclic perfect decompositions of 3Kn into T(⋃λP₂) triples for all n ≡ 1 (mod 2λ) when λ is even (except for n = 4λ + 1 when λ > 8) as well as completely solve the case λ = 3.

Item Type: Thesis (Masters)
Item ID: 8886
Additional Information: Includes bibliographical references (leaves [100]-102).
Department(s): Science, Faculty of > Mathematics and Statistics
Date: 2008
Date Type: Submission
Library of Congress Subject Heading: Decomposition (Mathematics); Graph theory; Incomplete block designs

Actions (login required)

View Item View Item


Downloads per month over the past year

View more statistics