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

Horsley Daniel | Zendy; Pike David A. | Zendy; Sanaei Asiyeh | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

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

Author(s) -

Horsley Daniel,

Pike David A.,

Sanaei Asiyeh

Publication year - 2011

Publication title -

journal of combinatorial designs

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.618

H-Index - 34

eISSN - 1520-6610

pISSN - 1063-8539

DOI - 10.1002/jcd.20283

Subject(s) - combinatorics , mathematics , vertex (graph theory) , disjoint sets , intersection (aeronautics) , block (permutation group theory) , block size , discrete mathematics , closure (psychology) , graph , computer science , computer security , key (lock) , economics , engineering , market economy , aerospace engineering

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

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research