𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Existential closure of block intersection graphs of infinite designs having infinite block size

✍ Scribed by Daniel Horsley; David A. Pike; Asiyeh Sanaei


Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
143 KB
Volume
19
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis


A graph G is n-existentially closed (n-e.c.) if for each pair (A,B) of disjoint subsets of V(G) with |A|+|B|≀n there exists a vertex in V(G)(AβˆͺB) which is adjacent to each vertex in A and to no vertex in B. In this paper we study the n-existential closure property of block intersection graphs of infinite designs with infinite block size.


πŸ“œ SIMILAR VOLUMES


Existential closure of block intersectio
✍ David A. Pike; Asiyeh Sanaei πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 129 KB

In this article we study the n-existential closure property of the block intersection graphs of infinite t-(v, k, k) designs for which the block size k and the index k are both finite. We show that such block intersection graphs are 2-e.c. when 2 ≀ t ≀ k-1. When k = 1 and 2 ≀ t ≀ k, then a necessary

Cycles in the block-intersection graph o
✍ Donovan R. Hare πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 580 KB

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.

An infinite class of fibres in CURDs wit
✍ Melissa S. Keranen; Rolf S. Rees; Alan C.H. Ling πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 207 KB

## Abstract Class‐uniformly resolvable designs (CURDs) are introduced by Lamken et al. Discrete Math 92 (1991) 197–209. In Wevrick and Vanstone, J Combin Designs 4 (1996) 177–202, a classification scheme is developed based on the ratio __a__:__b__ of pairs to triples. Asymptotic existence results a