Further results on existentially closed graphs arising from block designs
From MaRDI portal
Publication:2287728
DOI10.1007/s00373-019-02036-zzbMath1431.05023arXiv1810.07719OpenAlexW3106478400WikidataQ128113704 ScholiaQ128113704MaRDI QIDQ2287728
Publication date: 21 January 2020
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.07719
pairwise balanced designSteiner quadruple systemtriple systemblock intersection graphexistential closure
Combinatorial aspects of block designs (05B05) Structural characterization of families of graphs (05C75) Triple systems (05B07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classification algorithms for codes and designs
- Properties of the Steiner triple systems of order 19
- Existentially closed BIBD block-intersection graphs
- Graphs which contain all small graphs
- On the existence of 2-designs Slambda(2,3,v) without repeated blocks
- Embeddings of simple triple systems
- Steiner quadruple systems - a survey
- Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property
- Allgemeine Schnittzahlen in t-Designs. (General intersection numbers in t-designs)
- Köhler theory for countable quadruple systems
- 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
- Existential closure of block intersection graphs of infinite designs having infinite block size
- On Quadruple Systems
- Paley graphs satisfy all first-order adjacency axioms
- On the adjacency properties of paley graphs
- The random graph
- Asymmetric graphs
- On an adjacency property of almost all graphs
This page was built for publication: Further results on existentially closed graphs arising from block designs
