Existential closure of block intersection graphs of infinite designs having infinite block size
From MaRDI portal
Publication:3087614
DOI10.1002/jcd.20283zbMath1225.05035OpenAlexW1996563160MaRDI QIDQ3087614
Daniel Horsley, Asiyeh Sanaei, David A. Pike
Publication date: 16 August 2011
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20283
Combinatorial aspects of block designs (05B05) Structural characterization of families of graphs (05C75)
Related Items
Resolvability of infinite designs ⋮ Further results on existentially closed graphs arising from block designs
Cites Work
- A prolific construction of strongly regular graphs with the \(n\)-e. c. property
- Existentially closed BIBD block-intersection graphs
- Graphs with the \(n\)-e.c. adjacency property constructed from affine planes
- Steiner triple systems and existentially closed graphs
- Existential closure of block intersection graphs of infinite designs having finite block size and index
- Graphs with then-e.c. adjacency property constructed from resolvable designs
- Paley graphs satisfy all first-order adjacency axioms
- What is an infinite design?
- Asymmetric graphs