2002/03/01 by Péter Frankl, Vojtěch Rödl · 157 citations
Mathematics · Computer Science · #Limits and Structures in Graph Theory #Digital Image Processing Techniques #Advanced Graph Theory Research #Set (abstract data type) #Computer science #Mathematics #Programming language
paper · doi:10.1002/rsa.10017.abs
published in Random Structures and Algorithms 20(2), 131-164 (Wiley)
openalex publication_date 2002/03/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/11
For a family F (k) = fF 2 ; : : : ; F t g of k-uniform hypergraphs let ex(n; F (k)) denote the maximum number of k-tuples which a k-uniform hypergraph on n vertices may have, while not containing any member of F (k). Let rk (n) denote the maximum cardinality of a set of integers Z [n], where Z contains no arithmetic progression of length k.