On an adjacency property of almost all graphs
From MaRDI portal
Publication:5937580
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)
05C35: Extremal problems in graph theory
05C80: Random graphs (graph-theoretic aspects)
05C75: Structural characterization of families of graphs
Related Items
Binary Covering Arrays and Existentially Closed Graphs, Homomorphisms and colourings of oriented graphs: an updated survey, Generalized pigeonhole properties of graphs and oriented graphs, Further results on existentially closed graphs arising from block designs, 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