Some Ramsey-Turán type results for hypergraphs
type: Item
instance of: scholarly article
title: Some Ramsey-Turán type results for hypergraphs
zbMATH Open document ID: 0658.05041
DOI: 10.1007/BF02189089
author: Vojtěch Rödl
author: Peter Frankl
published in: Combinatorica
publication date: 1988-01-01T00:00:00Z
review text: For a fixed k-graph (k-uniform hypergraph) G, the Turan-number ex(n,G) is the maximum number of edges in a k-graph on n vertices that does not contain an isomorphic copy of G. For \(k>2\), this function is very difficult to determine, so related problems are considered. Let \(\pi (G)=\lim_{n\to \infty}ex(n,G)/\left( \begin{matrix} n\\ k\end{matrix} \right).\) If only hypergraphs of order n with independent sets of order o(n) are considered, then corresponding to \(\pi\) (G) is an extremal parameter \(\rho\) (G), which clearly satisfies \(0\leq \rho (G)\leq \pi (G).\) For k- partite k-graphs, Erdős proved \(0=\rho (G)=\pi (G),\) but Erdős and Sos posed the question of the existence of k-graphs G with \(0<\rho (G)<\pi (G).\) The authors prove, but do not exhibit, the existence of infinitely many k-graphs G satisfying \(0<\rho (G)<\pi (G).\) There are other related results concerning the number of copies of special fixed k- graphs in ``dense'' families of k-graphs.
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 4075105
zbMATH Keywords: extremal theory
zbMATH Keywords: Ramsey theory
zbMATH Keywords: fixed k-graph
zbMATH Keywords: k-uniform hypergraph
zbMATH Keywords: Turan-number
zbMATH Keywords: isomorphic copy
MaRDI profile type: Publication
cites work: On a Ramsey-Turán type problem
cites work: On extremal problems of graphs and generalized graphs
cites work: On chromatic number of graphs and set-systems
cites work: More results on Ramsey-Turán type problems
cites work: On Ramsey - Turan type theorems for hypergraphs
cites work: Compactness results in extremal graph theory
cites work: Supersaturated graphs and hypergraphs
cites work: A new generalization of the Erdős-Ko-Rado theorem
cites work: An exact result for 3-graphs
cites work: Hypergraphs do not jump
cites work: On universality of graphs with uniformly distributed edges
description: scientific article; zbMATH DE number 4075105