2011/03/15 by Daniel Horsley, David A. Pike, Asiyeh Sanaei · 1 citation
Mathematics · Engineering · Computer Science · #Limits and Structures in Graph Theory #graph theory and CDMA systems #Advanced Graph Theory Research #Combinatorics #Mathematics #Vertex (graph theory) #Disjoint sets #Intersection (aeronautics) #Block (permutation group theory) #Block size #Discrete mathematics #Closure (psychology) #Graph #Computer science
paper · doi:10.1002/jcd.20283
openalex publication_date 2011/03/15 · openalex created_date 2025/10/10 · openalex updated_date 2025/11/06
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. © 2011 Wiley Periodicals, Inc. J Combin Designs 19:317-327, 2011