Existential closure of block intersection graphs of infinite designs having infinite block size (Q3087614): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graphs with the \(n\)-e.c. adjacency property constructed from affine planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with the<i>n</i>-e.c. adjacency property constructed from resolvable designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paley graphs satisfy all first-order adjacency axioms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A prolific construction of strongly regular graphs with the \(n\)-e. c. property / rank
 
Normal rank
Property / cites work
 
Property / cites work: What is an infinite design? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner triple systems and existentially closed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existentially closed BIBD block-intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existential closure of block intersection graphs of infinite designs having finite block size and index / rank
 
Normal rank

Latest revision as of 10:09, 4 July 2024

scientific article
Language Label Description Also known as
English
Existential closure of block intersection graphs of infinite designs having infinite block size
scientific article

    Statements

    Identifiers