The search for N-e.c. Graphs

MaRDI QIDQ3558637zbMATH OpenFDO

Authors Anthony Bonato

Publication date 5 May 2010

zbMATH Keywords

adjacency propertiesgraphs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Random graphs (graph-theoretic aspects) (05C80) Finite affine and projective planes (geometric aspects) (51E15)

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

Cited in

(27)

• Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property
• Oriented colourings of graphs with maximum degree three and four
• A strongly regular \(n\)-full graph of small order
• On explicit random-like tournaments
• Ample simplicial complexes
• Further results on existentially closed graphs arising from block designs
• An explicit construction of \((3,t)\)-existentially closed graphs
• Graphs with the n-e.c. adjacency property constructed from affine planes
• On 2-e. c. line-critical graphs
• Homomorphisms and colourings of oriented graphs: an updated survey
• On 2-e.c. graphs, tournaments, and hypergraphs
• Existential closure of block intersection graphs of infinite designs having finite block size and index
• A construction of 3-existentially closed graphs using quadrances
• Existentially closed graphs via permutation polynomials over finite fields
• Graphs with the \(n\)-e.c. adjacency property constructed from resolvable designs
• scientific article; zbMATH DE number 2061960 (Why is no real title available?)
• Triply existentially complete triangle-free graphs
• Adjacency properties of graphs and a conjecture of Erdős
• Generating infinite random graphs
• On an adjacency property of almost all graphs
• Private simultaneous messages based on quadratic residues
• Existential closure in line graphs
• Large simplicial complexes: universality, randomness, and ampleness
• A prolific construction of strongly regular graphs with the n-e. c. property
• Existential closure in uniform hypergraphs
• Cubic and quadruple Paley graphs with the n-e.c. property
• On graphs isomorphic to their neighbour and non-neighbour sets

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)