Counting subgraphs in quasi‐random 4‐uniform hypergraphs (Q4667862): 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/rsa.20056 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2528769944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity lemmas for hypergraphs and quasi-randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On characterizing hypergraph regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The uniformity lemma for hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hereditary Properties of Triple Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity properties for triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of triple systems not containing a fixed one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Small Cliques in 3-uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey properties of random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity Lemma for k-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101924 / rank
 
Normal rank

Latest revision as of 09:15, 10 June 2024

scientific article; zbMATH DE number 2159952
Language Label Description Also known as
English
Counting subgraphs in quasi‐random 4‐uniform hypergraphs
scientific article; zbMATH DE number 2159952

    Statements

    Identifiers

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