✦ LIBER ✦

Superpure digraph designs

✍ Scribed by Sven Hartmann

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 174 KB
Volume: 10
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.10013

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A digraph design is a decomposition of a complete (symmetric) digraph into copies of pre‐specified digraphs. Well‐known examples for digraph designs are Mendelsohn designs, directed designs or orthogonal directed covers. A digraph design is superpure if any two of the subdigraphs in the decomposition have no more than two vertices in common. We give an asymptotic existence theorem for superpure digraph designs, which is a variation of an earlier result of Lamken and Wilson J Combin Theory Ser A 89: 149–200, 2000. As an immediate consequence, we obtain new results for supersimple designs and pure perfect Mendelsohn designs. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 239–255, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/jcd.10013

📜 SIMILAR VOLUMES

Hypotraceable digraphs

✍ Martin Grötschel; Carsten Thomassen; Yoshiko Wakabayashi 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB

## Abstract A hypotraceable digraph is a digraph __D__ = (__V, E__) which is not traceable, i.e., does not contain a (directed)Hamiltonian path, but for which __D__ ‐ __v__ is traceable for all __ve__ ∈ __V__. We prove that a hypotraceable digraph of order __n__ exists iff __n__ ≥ 7 and that for ea

An extremal function for digraph subcont

An extremal function for digraph subcontraction

✍ Jagger, Chris 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 400 KB

We determine, to within a constant factor, the maximum size of a digraph which has no subcontraction to the complete digraph DK, of order p. Let d(p) be defined for positive integers p by d(p) = inf{c; e(D) 2 clDI implies D % DK,}, where D denotes a digraph, and + denotes contraction. We show that 0

On independent circuits of a digraph

✍ S. Rao Kosaraju 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

## Abstract If every three circuits of a digraph have a common vertex, then all the circuits have one.

An Infinite Highly Arc-transitive Digrap

An Infinite Highly Arc-transitive Digraph

✍ David M. Evans 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 231 KB

The main purpose of this note is to construct an infinite , highly arc-transitive digraph with finite out-valency , and with out-spread greater than 1 , which does not have the two-way infinite path Z as a homomorphic image . This answers Question 3 . 8 in the paper [3] of Cameron , Praeger and Worm

Girth in digraphs

✍ J. C. Bermond; A. Germa; M. C. Heydemann; D. Sotteau 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 211 KB

## Abstract For an integer __k__ > 2, the best function __m__(__n, k__) is determined such that every strong digraph of order __n__ with at least __m__(__n, k__) arcs contains a circuit of length __k__ or less.

Counting strong digraphs

✍ Robert W. Robinson 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB