On an adjacency property of almost all graphs

DOI10.1016/S0012-365X(00)00309-5zbMath0973.05043MaRDI QIDQ5937580

Kathie Cameron, Anthony Bonato

Publication date: 28 November 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

\(n\)-existentially closedadjacency propertyBoolean operationscritical graphsrandom graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Structural characterization of families of graphs (05C75)

Related Items (7)

Generalized pigeonhole properties of graphs and oriented graphs ⋮ Homomorphisms and colourings of oriented graphs: an updated survey ⋮ Binary Covering Arrays and Existentially Closed Graphs ⋮ On an adjacency property of almost all tournaments ⋮ Graphs with the \(n\)-e.c. adjacency property constructed from affine planes ⋮ Graphs with then-e.c. adjacency property constructed from resolvable designs ⋮ Further results on existentially closed graphs arising from block designs

This page was built for publication: On an adjacency property of almost all graphs