Graphs with the n-e.c. adjacency property constructed from resolvable designs

DOI10.1002/JCD.20210MaRDI QIDQ3578153zbMATH OpenOpenAlexFDO

Authors Catharine A. Baker, Anthony Bonato, Neil A. McKay, Paweł Prałat

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

zbMATH Keywords

\(n\)-e.c. graphsadjacency propertiesaffine planesgraphsrandom graphsresolvable designsSteiner 2-designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Graphs with the n-e.c. adjacency property constructed from affine planes
• The search for N-e.c. Graphs
• On an adjacency property of almost all graphs
• A construction of 3-existentially closed graphs using quadrances
• A prolific construction of strongly regular graphs with the n-e. c. property

Cites work

• A Large Deviation Inequality for Functions of Independent, Multi-Way Choices
• 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
• On an adjacency property of almost all graphs
• Paley graphs satisfy all first-order adjacency axioms
• Probabilities on finite models
• Properties of almost all graphs and complexes
• Steiner triple systems and existentially closed graphs
• The random graph
• The search for the smallest 3-E.C. graphs

Cited in

(5)

• Graphs with the n-e.c. adjacency property constructed from affine planes
• Existential closure of block intersection graphs of infinite designs having infinite block size
• Designs with mutually orthogonal resolutions and decompositions of edge‐colored graphs
• scientific article; zbMATH DE number 2061960 (Why is no real title available?)
• Bounds and constructions for n-e.c. tournaments

This page was built for publication: Graphs with the \(n\)-e.c. adjacency property constructed from resolvable designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578153)