Short paths in quasi-random triple systems with sparse underlying graphs (Q2496208): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems on set systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number for hypergraph cycles. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short paths in 3-uniform quasi-random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dirac-Type Theorem for 3-Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank

Latest revision as of 17:02, 24 June 2024

scientific article
Language Label Description Also known as
English
Short paths in quasi-random triple systems with sparse underlying graphs
scientific article

    Statements

    Short paths in quasi-random triple systems with sparse underlying graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 July 2006
    0 references
    regularity lemma
    0 references
    hypergraphs
    0 references
    quasi-random structure
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references