The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent (Q1076037): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q105583451, #quickstatements; #temporary_batch_1714830986483
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On Sets of Integers Which Contain No Three Terms in Arithmetical Progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3313888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5567712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact result for 3-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3693528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for Turán's problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Asymptotic Number of Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing and covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On universality of graphs with uniformly distributed edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Certain Sets of Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4175585 / rank
 
Normal rank

Latest revision as of 14:23, 17 June 2024

scientific article
Language Label Description Also known as
English
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
scientific article

    Statements

    The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    0 references
    uniform hypergraph
    0 references
    0 references