Exact solution of some Turán-type problems
From MaRDI portal
Publication:1112819
DOI10.1016/0097-3165(87)90016-1zbMath0661.05003OpenAlexW2100896331MaRDI QIDQ1112819
Publication date: 1987
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(87)90016-1
Related Items
Hypergraphs without non-trivial intersecting subgraphs, Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three, Turán numbers for 3-uniform linear paths of length 3, Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three, Hypergraphs with no tight cycles, The maximum number of edges in a 3-graph not containing a given star, Turán numbers of sunflowers, Turán problems and shadows. II: Trees, Tournaments, 4-uniform hypergraphs, and an exact extremal result, Uniform hypergraphs containing no grids, Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths, Extremal Problems for Hypergraph Blowups of Trees, 3-uniform hypergraphs and linear cycles, The junta method in extremal hypergraph theory and Chvátal's conjecture, Turán numbers of Berge 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, On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees, Hypergraph Turán numbers of linear cycles, Multicolor Ramsey numbers for triple systems, Unavoidable subhypergraphs: \(\mathbf a\)-clusters, Set systems without a 3-simplex, Non-trivial \(d\)-wise intersecting families, Turán problems and shadows. I: Paths and cycles, 3-Uniform Hypergraphs and Linear Cycles, Union-intersecting set systems, New results on simplex-clusters in set systems, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, Unavoidable hypergraphs, On the maximum number of edges in a hypergraph with given matching number, One more Turán number and Ramsey number for the loose 3-uniform path of length three, Set systems without a simplex or a cluster, The uniformity lemma for hypergraphs, Partitioning ordered hypergraphs, Note on set systems without a strong simplex, On set systems without a simplex-cluster and the junta method, Linear trees in uniform hypergraphs, A hierarchy of maximal intersecting triple systems, Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems, On the \(d\)-cluster generalization of Erdős-Ko-Rado, Hypergraph extensions of the Erdős-Gallai theorem, Relative Turán numbers for hypergraph cycles, Invitation to intersection problems for finite sets, Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs, Hypergraphs without exponents, Triangle-free subgraphs of hypergraphs, Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 2, Hypergraphs Not Containing a Tight Tree with a Bounded Trunk, A homological approach to two problems on finite sets, Structure and stability of triangle-free set systems, Unavoidable subhypergraphs: a-clusters, Turán Problems and Shadows III: Expansions of Graphs, Covering non-uniform hypergraphs, Extremal problems whose solutions are the blowups of the small Witt- designs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The exact bound in the Erdős-Ko-Rado theorem
- Supersaturated graphs and hypergraphs
- On finite set-systems whose every intersection is a kernel of a star
- Linear dependencies among subsets of a finite set
- An exact result for 3-graphs
- A new short proof for the Kruskal-Katona theorem
- On a packing and covering problem
- Forbidding just one intersection
- Lower bounds for Turán's problem
- A new approach to Turán's conjecture
- The maximum number of edges in a 3-graph not containing a given star
- On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex
- On the combinatorial problems which I would most like to see solved
- Intersection theorems with geometric consequences
- Three-graphs without two triples whose symmetric difference is contained in a third
- On Sperner families satisfying an additional condition
- A note on the realization of distances within sets in euclidean space
- Extremal problems for finite sets and convex hulls---a survey
- Graphs without quadrilaterals
- On extremal problems of graphs and generalized graphs
- Intersection theorems for systems of sets
- On the existence of triangulated spheres in 3-graphs, and related problems
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection Theorems for Systems of Sets
- A General Intersection Theorem For Finite Sets
- An Extremal Set-Intersection Theorem
- Intersection Properties of Systems of Finite Sets
- On a Conjecture of Chvátal on m -Intersecting Hypergraphs
- On generalized graphs
- A new generalization of the Erdős-Ko-Rado theorem
