On Ramsey - Turán type theorems for hypergraphs
نویسندگان
چکیده
Let H’ be an r-uniform hypergraph. Let g=g(n; F) be the minimal integer so that any r-uniform hypergraph on n vertices and more than g edges contains a subgraph isomorphic to H’. Let e=f(n; H’, en) denote the minimal integer such that every r-uniform hypergraph on n vertices with more than e edges and with no independent set of .sn vertices contains a subgraph isomorphic to H’. We show that if r=-2 and H’ is e.g. a complete graph then
منابع مشابه
1 - Introduction to hypergraphs
We begin with an introduction to hypergraphs, which gives a taste of different representations of hypergraphs, linear hypergraphs, and Turán-type problems, including existence of Turán densities and classification of zero Turán densities. Thereafter we delve deeper into some of the classical theorems of hypergraph theory, including various theorems on intersecting families such as Sperner’s The...
متن کاملRamsey-type theorems for lines in 3-space
The proofs of these statements all follow from geometric incidence bounds – such as the Guth-Katz bound on pointline incidences in R – combined with Turán-type results on independent sets in sparse graphs and hypergraphs. As an intermediate step towards the third result, we also show that for a fixed family of plane algebraic curves with s degrees of freedom, every set of n points in the plane ...
متن کاملOn the Ramsey-Turán numbers of graphs and hypergraphs
Let t be an integer, f(n) a function, and H a graph. Define the t-Ramsey-Turán number of H, RTt(n,H, f(n)), to be the maximum number of edges in an n-vertex, H-free graph G with αt(G) ≤ f(n), where αt(G) is the maximum number of vertices in a Kt-free induced subgraph of G. Erdős, Hajnal, Simonovits, Sós, and Szemerédi [5] posed several open questions about RTt(n,Ks, o(n)), among them finding th...
متن کاملHereditary properties of hypergraphs
A hereditary property P is a class of k-graphs closed under isomorphism and taking induced sub-hypergraphs. Let P (k) n denote those k-graphs of P (k) on vertex set {1, . . . , n}. We prove an asymptotic formula for log2 |P (k) n | in terms of a Turán-type function concerning forbidden induced sub-hypergraphs. This result complements several existing theorems for hereditary and monotone graph a...
متن کاملOn splittable colorings of graphs and hypergraphs
The notion of a split coloring of a complete graph was introduced by Erdős and Gyárfás [7] as a generalization of split graphs. In this paper, we offer an alternate interpretation by comparing such a coloring to the classical Ramsey coloring problem via a two-round game played against an adversary. We show that the techniques used and bounds obtained on the extremal (r,m)-split coloring problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorica
دوره 2 شماره
صفحات -
تاریخ انتشار 1982