Hybrid triple systems and cubic feedback sets |
| |
Authors: | Charles J Colbourn William R Pulleyblank Alexander Rosa |
| |
Institution: | (1) Department of Computer Science, University of Waterloo, N2L 3G1 Waterloo, Ontario, Canada;(2) Department of Combinatorics, Optimization University of Waterloo, N2L 3G1 Waterloo, Ontario, Canada;(3) Department of Mathematics, Statistics McMaster University, L8S 4K1 Hamilton, Ontario, Canada |
| |
Abstract: | Ac-hybrid triple system of orderv is a decomposition of the completev-vertex digraph intoc cyclic tournaments of order 3 and
transitive tournaments of order 3. Hybrid triple systems generalize directed triple systems (c = 0) and Mendelsohn triple systems (c = v(v – 1)/3); omitting directions yields an underlying twofold triple system. The spectrum ofv andc for which ac-hybrid triple system of orderv exists is completely determined in this paper. Using (cubic) block intersection graphs, we then show that every twofold triple system of order
underlies ac-hybrid triple system with
. Examples are constructed for all sufficiently largev, for which this maximum is at most
. The lower bound here is proved by establishing bounds onF
i
(n, r), the size of minimum cardinality vertex feedback sets inn-vertexi-connected cubic multigraphs havingr repeated edges. We establish that
,
. These bounds are all tight, and the latter is used to derive the lower bound in the design theoretic problem. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|