Graphs with the<i>n</i>-e.c. adjacency property constructed from resolvable designs (Q3578153): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jcd.20210 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078909675 / rank
 
Normal rank
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: Paley graphs satisfy all first-order adjacency axioms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of almost all graphs and complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs which contain all small graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an adjacency property of almost all graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The random graph / 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: Probabilities on finite models / 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: Q3012580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Large Deviation Inequality for Functions of Independent, Multi-Way Choices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existentially closed BIBD block-intersection graphs / rank
 
Normal rank

Latest revision as of 23:53, 2 July 2024

scientific article
Language Label Description Also known as
English
Graphs with the<i>n</i>-e.c. adjacency property constructed from resolvable designs
scientific article

    Statements

    Graphs with the<i>n</i>-e.c. adjacency property constructed from resolvable designs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 July 2010
    0 references
    graphs
    0 references
    resolvable designs
    0 references
    adjacency properties
    0 references
    \(n\)-e.c. graphs
    0 references
    random graphs
    0 references
    Steiner 2-designs
    0 references
    affine planes
    0 references

    Identifiers