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 in
Orbits of infinite block designs
β Scribed by Bridget S. Webb
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 332 KB
- Volume
- 169
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
Let ~ be a 2- (v,k,2) design with k finite. When v is finite it is well known that blocktransitivity implies point-transitivity, whereas for infinite designs the relationship between the numbers of point and block orbits is unknown. We find bounds for the number of block and point orbits and provide a combinatorial proof generalising the result of Cameron that a Steiner triple system has at least as many block orbits as point orbits. We generalise some results of Camina on block-transitive designs and find an upper bound for the point rank.
π SIMILAR VOLUMES
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