The search for N-e.c. Graphs
From MaRDI portal
Publication:3558637
zbMATH Open1203.05138MaRDI QIDQ3558637FDOQ3558637
Authors: Anthony Bonato 
Publication date: 5 May 2010
Recommendations
- A prolific construction of strongly regular graphs with the \(n\)-e. c. property
- A construction of 3-existentially closed graphs using quadrances
- Cubic and quadruple Paley graphs with the \(n\)-e.c. property
- Graphs with the \(n\)-e.c. adjacency property constructed from affine planes
- On an adjacency property of almost all graphs
Random graphs (graph-theoretic aspects) (05C80) Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Finite affine and projective planes (geometric aspects) (51E15)
Cited In (26)
- On graphs isomorphic to their neighbour and non-neighbour sets
- On 2-e. c. line-critical graphs
- A prolific construction of strongly regular graphs with the \(n\)-e. c. property
- Ample simplicial complexes
- Title not available (Why is that?)
- Homomorphisms and colourings of oriented graphs: an updated survey
- Cubic and quadruple Paley graphs with the \(n\)-e.c. property
- On an adjacency property of almost all graphs
- Generating infinite random graphs
- Existentially closed graphs via permutation polynomials over finite fields
- Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property
- Existential closure in line graphs
- Adjacency properties of graphs and a conjecture of Erdős
- Private simultaneous messages based on quadratic residues
- On explicit random-like tournaments
- Further results on existentially closed graphs arising from block designs
- On 2-e.c. graphs, tournaments, and hypergraphs
- Triply existentially complete triangle-free graphs
- Large simplicial complexes: universality, randomness, and ampleness
- Graphs with the \(n\)-e.c. adjacency property constructed from affine planes
- A construction of 3-existentially closed graphs using quadrances
- Existential closure of block intersection graphs of infinite designs having finite block size and index
- Graphs with the \(n\)-e.c. adjacency property constructed from resolvable designs
- A strongly regular \(n\)-full graph of small order
- An explicit construction of \((3,t)\)-existentially closed graphs
- Oriented colourings of graphs with maximum degree three and four
This page was built for publication: The search for N-e.c. Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558637)
