Pages that link to "Item:Q5896187"
From MaRDI portal
The following pages link to A new generalization of the Erdős-Ko-Rado theorem (Q5896187):
Displaying 49 items.
- Mini-workshop: Hypergraph Turán problem. Abstracts from the mini-workshop held April 8--14, 2012. (Q343331) (← links)
- Turán number of generalized triangles (Q346455) (← links)
- Almost all triangle-free triple systems are tripartite (Q452822) (← links)
- Turán problems on non-uniform hypergraphs (Q470944) (← links)
- Counting substructures. II: Hypergraphs (Q485550) (← links)
- A structural result for 3-graphs (Q512589) (← links)
- Set systems without a simplex or a cluster (Q532128) (← links)
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters (Q640838) (← links)
- Hypergraphs with independent neighborhoods (Q653790) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- Hypergraphs in which all disjoint pairs have distinct unions (Q760430) (← links)
- An exact result for 3-graphs (Q793054) (← links)
- Extremal problems whose solutions are the blowups of the small Witt- designs (Q807640) (← links)
- A new generalization of Mantel's theorem to \(k\)-graphs (Q885302) (← links)
- An exact Turán result for tripartite 3-graphs (Q888608) (← links)
- On Turán densities of small triple graphs (Q896067) (← links)
- An exact Turán result for the generalized triangle (Q949792) (← links)
- Set systems with union and intersection constraints (Q1026003) (← links)
- Some Ramsey-Turán type results for hypergraphs (Q1111567) (← links)
- Exact solution of some Turán-type problems (Q1112819) (← links)
- Families of finite sets in which no set is covered by the union of two others (Q1166519) (← links)
- On the Turán number of triple systems (Q1865386) (← links)
- Stability theorems for cancellative hypergraphs (Q1880797) (← links)
- On set systems without a simplex-cluster and the junta method (Q2010639) (← links)
- On the \(d\)-cluster generalization of Erdős-Ko-Rado (Q2037168) (← links)
- Structural results for conditionally intersecting families and some applications (Q2185223) (← links)
- Shattered matchings in intersecting hypergraphs (Q2229336) (← links)
- New results on simplex-clusters in set systems (Q2236657) (← links)
- On \(k\)-uniform random hypergraphs without generalized fans (Q2243140) (← links)
- Asymptotic solution of a Turán-type problem (Q2276984) (← links)
- \(d\)-cluster-free sets with a given matching number (Q2323253) (← links)
- Erdős--Ko--Rado for three sets (Q2368657) (← links)
- An intersection theorem for four sets (Q2383002) (← links)
- \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles (Q2421871) (← links)
- Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\) (Q2461770) (← links)
- 4-books of three pages (Q2497972) (← links)
- Unavoidable subhypergraphs: a-clusters (Q2851439) (← links)
- Simplex Stability (Q3557500) (← links)
- On Mubayi's Conjecture and Conditionally Intersecting Sets (Q4684465) (← links)
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs (Q4903261) (← links)
- Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree (Q5001841) (← links)
- On the Chromatic Thresholds of Hypergraphs (Q5366886) (← links)
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians (Q5366952) (← links)
- Mantel's theorem for random hypergraphs (Q5740269) (← links)
- Uniform hypergraphs under certain intersection constraints between hyperedges (Q6113513) (← links)
- Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm (Q6133947) (← links)
- On Multicolor Ramsey Numbers of Triple System Paths of Length 3 (Q6170440) (← links)
- Some Cubic Time Regularity Algorithms for Triple Systems (Q6188523) (← links)
- Restricted problems in extremal combinatorics (Q6198640) (← links)
