Turán theorems with repeated degrees
نویسندگان
چکیده
منابع مشابه
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 ...
متن کاملIndependent sets and repeated degrees
We answer a question of Erdős, Faudree, Reid, Schelp and Staton by showing that for every integer k ≥ 2 there is a triangle-free graph G of order n such that no degree in G is repeated more than k times and ind(G) = (1 + o(1))n/k.
متن کاملStrong Descent Numbers and Turán Type Theorems ( Extended Abstract )
For a permutation π in the symmetric group Sn let the total degree be its valency in the Hasse diagram of the strong Bruhat order on Sn, and let the down degree be the number of permutations which are covered by π in the strong Bruhat order. The maxima of the total degree and the down degree and their values at a random permutation are computed. Proofs involve variants of a classical theorem of...
متن کاملTurán theorems and convexity invariants for directed graphs
This paper is motivated by the desire to evaluate certain classical convexity invariants (specifically, the Helly and Radon numbers) in the context of transitive closure of arcs in the complete digraph. To do so, it is necessary to establish several new Turán type results for digraphs and characterize the associated extremal digraphs. In the case of the Radon number, we establish the following ...
متن کاملMore Turán-Type Theorems for Triangles in Convex Point Sets
We study the following family of problems: Given a set of n points in convex position, what is the maximum number triangles one can create having these points as vertices while avoiding certain sets of forbidden configurations. As forbidden configurations we consider all 8 ways in which a pair of triangles in such a point set can interact. This leads to 256 extremal Turán-type questions. We giv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1992
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90644-u