The uniformity lemma for hypergraphs (Q1205340): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Peter Frankl / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Q688979 / rank
Normal rank
 
Property / author
 
Property / author: Peter Frankl / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Marie Demlová / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q124843215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of some Turán-type problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02351586 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027974205 / rank
 
Normal rank

Latest revision as of 08:49, 30 July 2024

scientific article
Language Label Description Also known as
English
The uniformity lemma for hypergraphs
scientific article

    Statements

    The uniformity lemma for hypergraphs (English)
    0 references
    0 references
    0 references
    1 April 1993
    0 references
    This is an extension of Szemerédi's theorem called the Uniformity Lemma for Graphs (see \textit{E. Szemerédi} [Problèmes combinatoires et théorie des graphes, Orsay 1976, Colloq. int. CNRS No. 260, 399-401 (1978; Zbl 0413.05055)]) to \(r\)-uniform hypergraphs. Two applications of the result are announced: proof of a conjecture of Erdős concerning Turán-type problem, and giving an alternative condition for quasirandomness.
    0 references
    uniformity lemma
    0 references
    Szemerédi's theorem
    0 references
    hypergraphs
    0 references

    Identifiers