Turán’s Theorem for the Fano Plane
نویسندگان
چکیده
منابع مشابه
On Turáns theorem for sparse graphs
a?nl(t+1) where a denotes the maximum size of an independent set in G. We improve this bound for graphs containing no large cliques. 0. Notation n=n(G)=number of vertices of the graph G e=e(G)=number of edges of G h=h(G)=number of triangles in G deg (P)=valency (degree) of the vertex P deg, (P) = triangle-valency of P=number of triangles in G adjacent to P t=t(G)=n f deg (P) = 2eln = average va...
متن کاملThe Turán Number Of The Fano Plane
Moreover, the only extremal configuration can be obtained by partitioning an n-element set into two almost equal parts, and taking all the triples that intersect both of them. This extends an earlier result of de Caen and Füredi, and proves an old conjecture of V. Sós. In addition, we also prove a stability result for the Fano plane, which says that a 3-uniform hypergraph with density close to ...
متن کاملBoundedness theorem for Fano log-threefolds
The main purpose of this article is to prove that the family of all Fano threefolds with log-terminal singularities with bounded index is bounded.
متن کاملOn the co-degree threshold for the Fano plane
Given a 3-graph H , let ex2(n,H) denote the maximum value of the minimum co-degree of a 3-graph on n vertices which does not contain a copy of H . Let F denote the Fano plane, which is the 3-graph {axx, ayy, azz , xyz , xyz, xyz, xyz }. Mubayi (2005) [14] proved that ex2(n, F) = (1/2 + o(1))n and conjectured that ex2(n, F) = ⌊n/2⌋ for sufficiently large n. Using a very sophisticated quasirandom...
متن کاملThe co-degree density of the Fano plane
It is shown that every n vertex triple system with every pair of vertices lying in at least (1/2 + o(1))n triples contains a copy of the Fano plane. The constant 1/2 is sharp. This is the first triple system for which such a (nonzero) constant is determined. Let X be a finite set. An r-graph F with vertex set X is a family of r-element subsets of X. These subsets are called edges, and X is writ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2019
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-019-3981-8