Paley graphs satisfy all first-order adjacency axioms
From MaRDI portal
Publication:3926623
DOI10.1002/jgt.3190050414zbMath0472.05058WikidataQ114696927 ScholiaQ114696927MaRDI QIDQ3926623
Geoffrey Exoo, Andreas Blass, Frank Harary
Publication date: 1981
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190050414
05C99: Graph theory
Related Items
Embedding arbitrary finite simple graphs into small strongly regular graphs, A note on graphs with a prescribed adjacency property, Infinite Paley graphs, Triply Existentially Complete Triangle‐Free Graphs, Unnamed Item, A partial refining of the Erdős-Kelly regulation, A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth, Graphs defined on groups, Binary Covering Arrays and Existentially Closed Graphs, Unnamed Item, On the Weisfeiler-Leman dimension of fractional packing, Irreducible nonmetrizable path systems in graphs, Cubic and quadruple Paley graphs with the \(n\)-e.c. property, Covering arrays from cyclotomy, Inducing regulation of any digraphs, Oriented colourings of graphs with maximum degree three and four, Ample simplicial complexes, Descriptive complexity of graph spectra, Further results on existentially closed graphs arising from block designs, 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, Tournaments and Semicomplete Digraphs, Paley and the Paley Graphs, Graphs with then-e.c. adjacency property constructed from resolvable designs
Cites Work
