✦ LIBER ✦

Cycles in the block-intersection graph of pairwise balanced designs

✍ Scribed by Donovan R. Hare

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 580 KB
Volume: 137
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0140-y

No coin nor oath required. For personal study only.

✦ Synopsis

It is shown that the block-intersection graph of a pairwise balance design with ),= l is edge-pancyclic given that its minimum block cardinality is at least 3.

📜 SIMILAR VOLUMES

Hamilton cycles in block-intersection gr

Hamilton cycles in block-intersection graphs of triple systems

✍ Peter Horák; David A. Pike; Michael E Raines 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 336 KB 👁 3 views

Given a BIBD S = (V, B), its 1-block-intersection graph GS has as vertices the elements of B; two vertices B1, B2 ∈ B are adjacent in GS if |B1 ∩ B2| = 1. If S is a triple system of arbitrary index λ, it is shown that GS is hamiltonian.

The efficiency of controls in balanced i

The efficiency of controls in balanced incomplete block designs

✍ Pešek, J. 📂 Article 📅 1974 🏛 Wiley (John Wiley & Sons) ⚖ 268 KB 👁 2 views

The number of repeated blocks in balance

The number of repeated blocks in balanced ternary designs with block size three II

✍ Elizabeth J. Billington; D.G. Hoffman 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 992 KB

The maximum number of diagonals of a cyc

The maximum number of diagonals of a cycle in a block and its extremal graphs

✍ Feng Tian; Wenan Zang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 739 KB

Tian, F. and W. Zang, The maximum number of diagonals of a cycle in a block and its extremal graphs, Discrete Mathematics 89 (1991) 51-63. In this paper we show that if G is a 2-connected graph having minimum degree n such that IV(G)1 L 2n + 1, then there exists a cycle in G having more than n(n -2

Further results on the maximum size of a

Further results on the maximum size of a hole in an incomplete t-wise balanced design with specified minimum block size

✍ I. Adamczak; D. L. Kreher; A. C. H. Ling; R. S. Rees 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB 👁 1 views

## Abstract Kreher and Rees 3 proved that if __h__ is the size of a hole in an incomplete balanced design of order υ and index λ having minimum block size $k \ge t+1$, then, They showed that when __t__ = 2 or 3, this bound is sharp infinitely often in that for each __h__ ≥ __t__ and each __k__ ≥ _