Graphs with then-e.c. adjacency property constructed from resolvable designs
From MaRDI portal
Publication:3578153
DOI10.1002/jcd.20210zbMath1227.05226MaRDI QIDQ3578153
Anthony Bonato, Paweł Prałat, Neil A. McKay, Catharine A. Baker
Publication date: 13 July 2010
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20210
random graphs; graphs; affine planes; resolvable designs; Steiner 2-designs; \(n\)-e.c. graphs; adjacency properties
Related Items
Cites Work
- Unnamed Item
- A prolific construction of strongly regular graphs with the \(n\)-e. c. property
- Existentially closed BIBD block-intersection graphs
- Graphs which contain all small graphs
- Graphs with the \(n\)-e.c. adjacency property constructed from affine planes
- Steiner triple systems and existentially closed graphs
- Properties of almost all graphs and complexes
- Paley graphs satisfy all first-order adjacency axioms
- Probabilities on finite models
- A Large Deviation Inequality for Functions of Independent, Multi-Way Choices
- The random graph
- On an adjacency property of almost all graphs