Exact solution of some Turán-type problems
From MaRDI portal
Fifteen years ago Chvátal conjectued that if \({\mathcal F}\) is a family of k subsets of an n-set, \(| {\mathcal F}| >\left( \begin{matrix} n-1\\ k- 1\end{matrix} \right)\), d is an arbitrary integer with \(d\leq k-1\) and \((d+1)k\leq dn\), then there exist \(d+1\) sets in \({\mathcal F}\) with empty intersection such that the intersection of any d of them is non-empty. The validity of this conjecture is established for \(n\geq n_ 0(k)\), in a more general framework. Another problem which is solved asymptotically is when the excluded configuration is a fixed sunflower.
Recommendations
Cites work
- A General Intersection Theorem For Finite Sets
- A new approach to Turán's conjecture
- A new generalization of the Erdős-Ko-Rado theorem
- A new short proof for the Kruskal-Katona theorem
- A note on the realization of distances within sets in euclidean space
- An exact result for 3-graphs
- An Extremal Set-Intersection Theorem
- Extremal problems for finite sets and convex hulls---a survey
- Forbidding just one intersection
- Graphs without quadrilaterals
- scientific article; zbMATH DE number 3843786 (Why is no real title available?)
- scientific article; zbMATH DE number 4008289 (Why is no real title available?)
- scientific article; zbMATH DE number 4031696 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3691331 (Why is no real title available?)
- scientific article; zbMATH DE number 3758336 (Why is no real title available?)
- scientific article; zbMATH DE number 3467166 (Why is no real title available?)
- scientific article; zbMATH DE number 3523543 (Why is no real title available?)
- scientific article; zbMATH DE number 3561362 (Why is no real title available?)
- scientific article; zbMATH DE number 3609704 (Why is no real title available?)
- scientific article; zbMATH DE number 3621717 (Why is no real title available?)
- scientific article; zbMATH DE number 3453609 (Why is no real title available?)
- scientific article; zbMATH DE number 3221072 (Why is no real title available?)
- scientific article; zbMATH DE number 3224335 (Why is no real title available?)
- scientific article; zbMATH DE number 3258067 (Why is no real title available?)
- scientific article; zbMATH DE number 3407723 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- Intersection Properties of Systems of Finite Sets
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection theorems for systems of sets
- Intersection Theorems for Systems of Sets
- Intersection theorems with geometric consequences
- Linear dependencies among subsets of a finite set
- Lower bounds for Turán's problem
- On a Conjecture of Chvátal on m -Intersecting Hypergraphs
- On a packing and covering problem
- On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex
- On extremal problems of graphs and generalized graphs
- On finite set-systems whose every intersection is a kernel of a star
- On generalized graphs
- On Sperner families satisfying an additional condition
- On the combinatorial problems which I would most like to see solved
- On the existence of triangulated spheres in 3-graphs, and related problems
- Supersaturated graphs and hypergraphs
- The exact bound in the Erdős-Ko-Rado theorem
- The maximum number of edges in a 3-graph not containing a given star
- Three-graphs without two triples whose symmetric difference is contained in a third
Cited in
(66)- The maximum number of edges in a 3-graph not containing a given star
- The uniformity lemma for hypergraphs
- A homological approach to two problems on finite sets
- 3-uniform hypergraphs and linear cycles
- The junta method in extremal hypergraph theory and Chvátal's conjecture
- Covering non-uniform hypergraphs
- Unavoidable hypergraphs
- Partitioning ordered hypergraphs
- On set systems without a simplex-cluster and the junta method
- On the \(d\)-cluster generalization of Erdős-Ko-Rado
- Relative Turán numbers for hypergraph cycles
- Hypergraphs without exponents
- Triangle-free subgraphs of hypergraphs
- Non-trivial \(d\)-wise intersecting families
- New results on simplex-clusters in set systems
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 2
- Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three
- Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three
- Tournaments, 4-uniform hypergraphs, and an exact extremal result
- Hypergraph Turán numbers of linear cycles
- Multicolor Ramsey numbers for triple systems
- Linear trees in uniform hypergraphs
- Turán numbers of Berge trees
- On the local and global mean orders of sub-k-trees of k-trees
- Unavoidable subhypergraphs: a-clusters
- Turán numbers for 3-uniform linear paths of length 3
- Daisies and other Turán problems
- Structure and stability of triangle-free set systems
- Turán problems and shadows. II: Trees
- Combinatorial Optimization Problems for Systems of Subsets
- Uniform hypergraphs containing no grids
- Exact solution of the hypergraph Turán problem for k-uniform linear paths
- 3-uniform hypergraphs and linear cycles
- A hierarchy of maximal intersecting triple systems
- Turán problems and shadows. I: Paths and cycles
- Union-intersecting set systems
- Hypergraphs with no tight cycles
- Turán numbers of sunflowers
- Hypergraph removal lemmas via robust sharp threshold theorems
- On the maximum number of edges in a hypergraph with given matching number
- Anti-Ramsey numbers of paths and cycles in hypergraphs
- One more Turán number and Ramsey number for the loose 3-uniform path of length three
- Hypergraphs not containing a tight tree with a bounded trunk
- Turán Problems and Shadows III: Expansions of Graphs
- Set systems without a simplex or a cluster
- scientific article; zbMATH DE number 6395611 (Why is no real title available?)
- Hypergraphs without non-trivial intersecting subgraphs
- Extremal Problems for Hypergraph Blowups of Trees
- Kalai's conjecture in \(r\)-partite \(r\)-graphs
- Dirac-type conditions for spanning bounded-degree hypertrees
- Improved bounds on the maximum diversity of intersecting families
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters
- Set systems without a 3-simplex
- A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs
- Turán numbers of ordered tight hyperpaths
- On the number of \(\mathcal{H}\)-free hypergraphs
- Turán number for bushes
- On Turán problems for suspension hypergraphs
- Triangle-free triple systems
- Some exact and asymptotic results for hypergraph Turán problems in _2-norm
- Linear dependencies, polynomial factors in the Duke-Erdős forbidden sunflower problem
- Hypergraph extensions of the Erdős-Gallai theorem
- Invitation to intersection problems for finite sets
- Extremal problems whose solutions are the blowups of the small Witt- designs
- Note on set systems without a strong simplex
This page was built for publication: Exact solution of some Turán-type problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1112819)
