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
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
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.
## 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