Paley graphs satisfy all first-order adjacency axioms

DOI10.1002/jgt.3190050414zbMath0472.05058OpenAlexW1979863880WikidataQ114696927 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

zbMATH Keywords

Paley graph

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (25)

Cubic and quadruple Paley graphs with the \(n\)-e.c. property ⋮ Binary Covering Arrays and Existentially Closed Graphs ⋮ A note on graphs with a prescribed adjacency property ⋮ Unnamed Item ⋮ Private simultaneous messages based on quadratic residues ⋮ Irreducible nonmetrizable path systems in graphs ⋮ A partial refining of the Erdős-Kelly regulation ⋮ A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth ⋮ Oriented colourings of graphs with maximum degree three and four ⋮ Paley and the Paley Graphs ⋮ Graphs with the \(n\)-e.c. adjacency property constructed from affine planes ⋮ Embedding arbitrary finite simple graphs into small strongly regular graphs ⋮ Graphs defined on groups ⋮ Graphs with then-e.c. adjacency property constructed from resolvable designs ⋮ On the Weisfeiler-Leman dimension of fractional packing ⋮ Covering arrays from cyclotomy ⋮ Descriptive complexity of graph spectra ⋮ Further results on existentially closed graphs arising from block designs ⋮ Infinite Paley graphs ⋮ Existential closure of block intersection graphs of infinite designs having infinite block size ⋮ Triply Existentially Complete Triangle‐Free Graphs ⋮ Inducing regulation of any digraphs ⋮ Unnamed Item ⋮ Tournaments and Semicomplete Digraphs ⋮ Ample simplicial complexes

Cites Work

• A Constructive Solution to a Tournament Problem
• HOW TO DESCRIBE A GRAPH

This page was built for publication: Paley graphs satisfy all first-order adjacency axioms