Some Ramsey-Turán type results for hypergraphs

DOI10.1007/BF02189089zbMath0658.05041MaRDI QIDQ1111567

Vojtěch Rödl, Peter Frankl

Publication date: 1988

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

Ramsey theoryextremal theoryisomorphic copyk-uniform hypergraphfixed k-graphTuran-number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Generalized Ramsey theory (05C55)

Related Items

A problem of Erdős and Sós on 3-graphs, Turán-Ramsey theorems and simple asymptotically extremal structures, Quasi-Random Set Systems, Some results on Lagrangians of hypergraphs, Tournaments, 4-uniform hypergraphs, and an exact extremal result, On the Maximum Number of Triangles in Wheel-Free Graphs, Turán-Ramsey Theorems and K_p-Independence Numbers, On vertex independence number of uniform hypergraphs, Hypergraphs with vanishing Turán density in uniformly dense hypergraphs, Quasi-random subsets of \(\mathbb{Z}_ n\), On testing the `pseudo-randomness' of a hypergraph, Extremal problems whose solutions are the blowups of the small Witt- designs

Cites Work

• More results on Ramsey-Turán type problems
• Supersaturated graphs and hypergraphs
• An exact result for 3-graphs
• On universality of graphs with uniformly distributed edges
• Hypergraphs do not jump
• On a Ramsey-Turán type problem
• Compactness results in extremal graph theory
• On Ramsey - Turan type theorems for hypergraphs
• On extremal problems of graphs and generalized graphs
• On chromatic number of graphs and set-systems
• A new generalization of the Erdős-Ko-Rado theorem