Triple Systems from Graph Decompositions Robert “Bob” Gardner Department of Mathematics East Tennessee State University 2008 Fall Southeastern Meeting.

Slides:



Advertisements
Similar presentations
What the Hell do Graph Decompositions have to do with Experimental Designs? Motivating Graph Packings and Coverings of Non-Complete Graphs “Old Bob” Gardner.
Advertisements

Chun-Cheng Chen Department of Mathematics National Central University 1.
22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.
Walks, Paths and Circuits Walks, Paths and Circuits Sanjay Jain, Lecturer, School of Computing.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
A study of Bull-design 牛型圖設計的探討 指導教授 高金美 博士 研 究 生研 究 生 羅淑玟 日 期 103 年 8 月 3 日.
Introduction to Graphs
MCA 520: Graph Theory Instructor Neelima Gupta
Representing Relations Using Matrices
Applied Discrete Mathematics Week 11: Graphs
The number of edge-disjoint transitive triples in a tournament.
DAG Warm-Up Problem. McNally and fellow guard Brandyn Curry, who combined for 26 second-half points, came up big for Harvard throughout the final frame.
SE561 Math Foundations Week 11 Graphs I
Combinatorial Designs and related Discrete Combinatorial Structures Discrete Mathematics Olin College Sarah Spence Adams Fall 2007.
Graph Theory in CS Route Search in Online Map Services
Balanced Path Decompositions of Crowns and Directed Crowns Hung-Chih Lee and Shun-Li Hsu Department of Information Technology Ling Tung University Taichung,
Combinatorial Designs and Related Discrete Combinatorial Structures Sarah Spence Adams Fall 2008.
Small Cycle Systems Chris Rodger Auburn University.
4/17/2017 Section 8.5 Euler & Hamilton Paths ch8.5.
Applied Discrete Mathematics Week 12: Trees
4-cycle Designs Hung-Lin Fu ( 傅恆霖 ) 國立交通大學應用數學系 Motivation The study of graph decomposition has been one of the most important topics in graph theory.
What is the first line of the backwards direction of this proof? 1.Assume G is a block. 2.Assume every pair of vertices lie on a common cycle. 3.Assume.
Cyclic and Bicyclic Decompositions of the Complete Graph into the 4-Cycle with a Pendant Edge Daniel “Lupo” Cantrell Gary “Hoser” Coker Robert “Knob” Gardner*
9.2 Graph Terminology and Special Types Graphs
Graphs Chapter 10.
Graph Theoretic Concepts. What is a graph? A set of vertices (or nodes) linked by edges Mathematically, we often write G = (V,E)  V: set of vertices,
On Edge-Balance Index Sets of L-Product of Cycles by Cycles Daniel Bouchard, Stonehill College Patrick Clark, Stonehill College Hsin-hao Su, Stonehill.
Lecture 5.2: Special Graphs and Matrix Representation CS 250, Discrete Structures, Fall 2013 Nitesh Saxena Adopted from previous lectures by Zeph Grunschlag.
Approximating the Minimum Degree Spanning Tree to within One from the Optimal Degree R 陳建霖 R 宋彥朋 B 楊鈞羽 R 郭慶徵 R
Trees and Distance. 2.1 Basic properties Acyclic : a graph with no cycle Forest : acyclic graph Tree : connected acyclic graph Leaf : a vertex of degree.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Chapter 1 Fundamental Concepts II Pao-Lien Lai 1.
Packing Graphs with 4-Cycles 學生 : 徐育鋒 指導教授 : 高金美教授 2013 組合新苗研討會 ( ~ ) 國立高雄師範大學.
Copyright © Zeph Grunschlag, More on Graphs.
Chapter 6 Graph Theory R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001.
1 CS104 : Discrete Structures Chapter V Graph Theory.
1 Rotational and Cyclic Cycle Systems 聯 合 大 學 吳 順 良.
GRAPHS THEROY. 2 –Graphs Graph basics and definitions Vertices/nodes, edges, adjacency, incidence Degree, in-degree, out-degree Subgraphs, unions, isomorphism.
1 Rainbow Decompositions Raphael Yuster University of Haifa Proc. Amer. Math. Soc. (2008), to appear.
The countable character of uncountable graphs François Laviolette Barbados 2003.
Edge-magic Indices of Stars Sin-Min Lee, San Jose State University Yong-Song Ho and Sie-Keng Tan, Nat’l Univ. of Singapore Hsin-hao Su *, Stonehill College.
Graph Colouring L09: Oct 10. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including the famous.
Chapter 1 Fundamental Concepts Introduction to Graph Theory Douglas B. West July 11, 2002.
Theory of Computation, Feodor F. Dragan, Kent State University 1 TheoryofComputation Spring, 2015 (Feodor F. Dragan) Department of Computer Science Kent.
MAT 2720 Discrete Mathematics Section 8.7 Planar Graphs
September1999 CMSC 203 / 0201 Fall 2002 Week #13 – 18/20/22 November 2002 Prof. Marie desJardins.
Graph Colouring Lecture 20: Nov 25. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including.
Graph Theory and Applications
Lecture 10: Graph-Path-Circuit
1 The Encoding Complexity of Network Coding Michael Langberg California Institute of Technology Joint work with Jehoshua Bruck and Alex Sprintson.
Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.
Introduction to Graph Theory
Introduction to Graph Theory
1 Finding a decomposition of a graph T into isomorphic copies of a graph G is a classical problem in Combinatorics. The G-decomposition of T is balanced.
Chapter 9: Graphs.
On k-Edge-magic Cubic Graphs Sin-Min Lee, San Jose State University Hsin-hao Su *, Stonehill College Yung-Chin Wang, Tzu-Hui Institute of Technology 24th.
Relations and Graphs Relations and Graphs Sanjay Jain, Lecturer, School of Computing.
Xuding Zhu National Sun Yat-sen University Circular chromatic index.
Fundamental Graph Theory (Lecture 1) Lectured by Hung-Lin Fu 傅 恆 霖 Department of Applied Mathematics National Chiao Tung University.
De Bruijn sequences 陳柏澍 Novembers Each of the segments is one of two types, denoted by 0 and 1. Any four consecutive segments uniquely determine.
Representing Relations Using Digraphs
Unsolved Problems in Graph Decompositions
Lecture 5.2: Special Graphs and Matrix Representation
Graphs Hubert Chan (Chapter 9) [O1 Abstract Concepts]
The countable character of uncountable graphs François Laviolette Barbados 2003.
Grade 11 AP Mathematics Graph Theory
Summary 3 Discrete Probability (sections )
MAT 2720 Discrete Mathematics
Grid-Block Designs and Packings
On k-Edge-magic Cubic Graphs
Presentation transcript:

Triple Systems from Graph Decompositions Robert “Bob” Gardner Department of Mathematics East Tennessee State University 2008 Fall Southeastern Meeting American Mathematical Society Special Session on Graph Decompositions University of Alabama, Huntsville October 25, 2008

1. Decompositions

Definition. A decomposition of a simple graph H with isomorphic copies of graph G is a set { G 1, G 2, …, G n } where G i G and V(G i ) V(H) for all i, E(G i ) ∩ E(G j ) = Ø if i ≠ j, and G i = H. Note. Decompositions of digraphs and mixed graphs are siimilarly defined.

Example. There is a decomposition of K 5 into 5-cycles.

(0,1,3) (1,2,4) (2,3,5) (3,4,6) (4,5,0) (5,6,1) (6,0,2) Example. There is a decomposition of K 7 into 3-cycles:

Definition. We shall restrict today’s presentation to decompositions of complete graphs (or complete digraphs or complete mixed graphs) into isomorphic copies of graphs on 3 (non-isolated) vertices. We refer to any such decomposition as a triple system.

2. Steiner Triple Systems

Definition. A Steiner triple system of order v, STS(v), is a decomposition of the complete graph on v vertices, K v, into 3-cycles.

From the Saint Andrews MacTutor History of Mathematics website. Jakob Steiner J. Steiner, Combinatorische Aufgabe, Journal für die Reine und angewandte Mathematik (Crelle’s Journal), 45 (1853), v ≡ 1 or 3 (mod 6) is necessary.

M. Reiss, Über eine Steinersche combinatorsche Aufgabe welche in 45sten Bande dieses Journals, Seite 181, gestellt worden ist, Journal für die Reine und angewandte Mathematik (Crelle’s Journal), 56 (1859), Theorem. A STS(v) exists if and only if v ≡ 1 or 3 (mod 6). Note. Sufficiency follows from Reiss.

Thomas P. Kirkman From the Saint Andrews MacTutor History of Mathematics website. T. Kirkman, On a problem in combinations, Cambridge and Dublin Mathematics Journal, 2 (1847), STS(v) iff v ≡ 1 or 3 (mod 6).

R. Peltesohn, Eine Lösung der beiden Heffterschen Differenzenprobleme, Compositio Math., 6 (1939), Constructions Based on Difference Methods L. Heffter, Ueber Triplesysteme, Math. Ann., 49 (1897), Heffter posed two difference problems: The Problems were solved by Peltesohn:

Theorem. A STS(v) admitting a cyclic automorphism exists if and only if v ≡ 1 or 3 (mod 6), v ≠ 9.

3. Mendelsohn and Directed Triple Systems

Note. There are two orientations of a 3-cycle: 3-circuit Transitive Triple

Nathan S. Mendelsohn From the Saint Andrews MacTutor History of Mathematics website. N. S. Mendelsohn, A Natural Generalization of Steiner Triple Systems, in: Computers in Number Theory (Academic Press, New York, 1971),

Theorem. A Mendelsohn triple system of order v exists if and only if v ≡ 0 or 1 (mod 3), v ≠ 6.

Theorem. A directed triple system of order v exists v if and only if v ≡ 0 or 1 (mod 3). S. H. Y. Hung and N. S. Mendelsohn, Directed Triple Systems, Journal of Combinatorial Theory, Series A, 14 (1973),

4. Ordered (Oriented) Triple Systems

C. C. Lindner and A. P. Street, Ordered triple systems and transitive quasigroups, Ars Combinatoria, 17A (1984), Definition. Lindner and Street (1984) define an ordered triple as either a 3-circuit or a transitive triple. They then define an ordered triple system of order v, OTS(v), as a decomposition of D v into copies of ordered triples. No restriction is put on the number of 3-circuits nor on the number of transitive triples.

B. Micale and M. Pennisi, Cyclic and Rotational Oriented Triple Systems, Ars Combinatoria, 35 (1993), Definition. Micale and Pennisi (1993) also dealt with ordered triple systems, but independently came up with the idea. They referred to them as oriented triple systems. Their study addressed two automorphism questions.

Theorem. An ordered (oriented) triple system of order v exists if and only if v ≡ 0 or 1 (mod 3).

5. Hybrid Triple Systems

C. J. Colbourn, W. R. Pulleyblank, and A. Rosa, Hybrid Triple Systems and Cubic Feedback Sets, Graphs and Combinatorics, 5 (1989), Definition. Colbourn, Pulleyblank, and Rosa (1989) define a hybrid triple system of order v, HTS(v), as a decomposition of K v into a given number of copies of 3-circuits and transitive triples. That is, a c-HTS(v) is a decomposition of D v into c copies of a 3-circuit and v(v – 1)/3 – c copies of a transitive triple. Note. When c = 0, a c-HTS(v) is a directed triple system of order v. When c = v(v – 1)/3, a c-HTS(v) is a Mendelsohn triple system of order v.

K. Heinrich, Simple Direct Constructions for Hybrid Triple Designs, Discrete Mathematics, 97 (1991), Theorem. A c-HTS(v) exists if and only if v ≡ 0 or 1 (mod 3), v ≠ 6 when c is 9 or 10, and c {0, 1, 2, …, v(v – 1)/3 – 2, v(v – 1)/3}. Note. Heinrich (1991) gave direct constructions for c- HTS(v) and solved the problem for λ-fold systems. c v(v – 1)/3 – c

6. The Last of the Triple Systems

A. Hartman and E. Mendelsohn, The Last of the Triple Systems, Ars Combinatoria, 22 (1986), Note. Hartman and Mendelsohn (1986) considered decompositions of the complete directed graph, D v, into every possible digraph on 3 vertices. In fact, they solved the problem for λ- fold complete digraphs.

DG GG T T TT T P MM M c c c Note. There are 13 different simple digraphs on 3 vertices:

7. Mixed Triple Systems

Definition. A mixed graph consists of a vertex set, and edge set, and an arc set. The complete mixed graph on v vertices, M v, has an edge between every two vertices and an arc from every vertex to every other vertex. M4M4

Note. There are 3 partial orientations of the 3-cycle with two arcs and one edge: T TT 12 3 Definition. A decomposition of M v into copies of T i is a T i -mixed triple system of order v.

Theorem. A T i -triple system of order v exists if and only if v ≡ 1 (mod 2) for i =1, 2, 3, except for v = 3, 5 when i = 3. T TT 12 3 R. Gardner, Triple Systems from Mixed Graphs, Bulletin of the ICA, 27 (1999),

Note. Inspired by Hartman and Mendelsohn (“The Last of the Triple Systems”), we are lead to consider all possible mixed graphs on 3 vertices. There are 18 such mixed graphs with (like M v ) twice as many arcs as edges.

T TT T T T T T T T TTT TT T T T 4 1

Note. Decompositions of M v into each of the 18 mixed graphs above is currently being studied by Ernest Jum as part of his master’s thesis at East Tennessee State University. Current Progress. Mr. Jum has one case left (T 4 and its converse) when λ = 1. The thesis will be titled “The Last of the Mixed Triple Systems.” 6

Some Observations about T 4 Decompositions There is a T 4 -decomposition of M 4. For v ≡ 1 or 4 (mod 12), there is an M 4 decomposition of D v (Hanani). So there is a T 4 -decomposition of D v for all v ≡ 1 or 4 (mod 12). H. Hanani, Balanced incomplete block designs and related designs, Discrete Mathematics, 11 (1975), T4T

Some Observations about T 4 Decompositions (cont.) One can see from the decomposition of M 4 into copies of T 4, that the “mixed wheel” can be decomposed into copies of T 4 also. Hartman and Mendelsohn used wheels extensively in some of their constructions, and similar constructions are used in additional T 4 – decompositions. T4T

8. Hybrid Triple Systems from Digraph-Pair Multidecompositions

A. Abueida and M. Devan, Multidesigns for Graph-Pairs of Order 4 and 5, Graphs and Combinatorics, 19 (2003), Definition. A graph-pair of order t is two non- isomorphic graphs G and H on t (non-isolated) vertices for which G U H = K t. A decomposition of K v into a collection of copies of G and copies of H, where at least one copy of each is present, is a (G,H)- multidecomposition of K v (Abueida and Devan). GH

Note. We define a digraph-pair similar to the definition of a graph-pair and concentrate on digraph-pairs of order 3. This gives three such pairs. G1G1 G2G2 G3G3 H1H1 H2H2 H3H3

Note. We now introduce the concept of a hybrid triple system based on digraph multidecompositions. We study (G i, H i )-multidecompositions of D v which consist of g i copies of G i and h i = (v(v – 1)/3 – g i )/2 copies of H i, for all possible values of g i and h i (for i {1, 2, 3}). We call such a decomposition a g i -hybrid triple system of type i and order v. This work is being done jointly by Beeler and Gardner.

Lemma. Each vertex of G 1 and each vertex of H 1 has out- degree even, so a necessary condition for the existence of a g 1 -hybrid triple system of order v is that v ≡ 1 (mod 2). G1G1 H1H1

Note. G 1 can be decomposed into two copies of H 1. G1G1 H 1 U H 1 Theorem. A G 1 -decomposition of D v exists iff v ≡ 1 (mod 4) (Hartman and Mendelsohn). Theorem. When v ≡ 1 (mod 4), a g 1 -hybrid triple system of order v exists iff g 1 {0, 1, 2, …, v(v – 1)/4} and h 1 = (v(v – 1) – 4g 1 )/2.

Lemma. A necessary condition for a g 1 -hybrid triple system of order v ≡ 3 (mod 4) is h 1 ≥ v/3. Proof. Suppose not. Then there is some vertex x in no copy of H 1. For x to have out-degree v – 1 (even), x must be in exactly (v – 1)/2 blocks of the following form: x In the union of these blocks, x has total in- degree (v – 1)/2 ≡ 1 (mod 2). But in the remaining blocks x is of in-degree even. So in the collection of G 1 s, x is of total in-degree odd, contradiction. Therefore every vertex of D v must be in at least one copy of H 1.

Conjecture. A g 1 -hybrid triple system of order v exists iff v ≡ 1 (mod 4) and g 1 {0, 1, 2, …, v(v – 1)/4} and h 1 = (v(v – 1) – 4g 1 )/2, or v ≡ 3 (mod 4) and h 1 { v/3, v/3 +1, …, v(v – 1)/4} and g 1 = (v(v – 1) – 2h 1 )/4.

Note. Since G 1 and G 2 are converses, the existence of a g 2 -hybrid triple system will follow from the existence of a g 1 -hybrid triple system. Current Progress. With the possible exception of some small cases, the existence of g 3 -hybrid triple systems is mostly settled.