Pages that link to "Item:Q1112819"
From MaRDI portal
The following pages link to Exact solution of some Turán-type problems (Q1112819):
Displaying 50 items.
- Turán numbers for 3-uniform linear paths of length 3 (Q286115) (← links)
- Turán problems and shadows. II: Trees (Q345098) (← links)
- Uniform hypergraphs containing no grids (Q390731) (← links)
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths (Q397075) (← links)
- Turán problems and shadows. I: Paths and cycles (Q472166) (← links)
- Union-intersecting set systems (Q497346) (← links)
- On the maximum number of edges in a hypergraph with given matching number (Q516783) (← links)
- One more Turán number and Ramsey number for the loose 3-uniform path of length three (Q521762) (← links)
- Set systems without a simplex or a cluster (Q532128) (← links)
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters (Q640838) (← links)
- Set systems without a 3-simplex (Q641176) (← links)
- Hypergraph extensions of the Erdős-Gallai theorem (Q739066) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- Extremal problems whose solutions are the blowups of the small Witt- designs (Q807640) (← links)
- Note on set systems without a strong simplex (Q968446) (← links)
- The maximum number of edges in a 3-graph not containing a given star (Q1095933) (← links)
- The uniformity lemma for hypergraphs (Q1205340) (← links)
- A homological approach to two problems on finite sets (Q1283453) (← links)
- 3-uniform hypergraphs and linear cycles (Q1689945) (← links)
- The junta method in extremal hypergraph theory and Chvátal's conjecture (Q1689997) (← links)
- Covering non-uniform hypergraphs (Q1850546) (← links)
- Unavoidable hypergraphs (Q1984522) (← links)
- Partitioning ordered hypergraphs (Q2005178) (← 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)
- Relative Turán numbers for hypergraph cycles (Q2043404) (← links)
- Hypergraphs without exponents (Q2049452) (← links)
- Triangle-free subgraphs of hypergraphs (Q2053717) (← links)
- Non-trivial \(d\)-wise intersecting families (Q2221841) (← links)
- New results on simplex-clusters in set systems (Q2236657) (← links)
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture (Q2237385) (← links)
- Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 2 (Q2309552) (← links)
- Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three (Q2363695) (← links)
- Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three (Q2374165) (← links)
- Tournaments, 4-uniform hypergraphs, and an exact extremal result (Q2399352) (← links)
- Hypergraph Turán numbers of linear cycles (Q2434896) (← links)
- Multicolor Ramsey numbers for triple systems (Q2436825) (← links)
- Linear trees in uniform hypergraphs (Q2509754) (← links)
- Turán numbers of Berge trees (Q2685321) (← links)
- On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees (Q2692183) (← links)
- Unavoidable subhypergraphs: a-clusters (Q2851439) (← links)
- Structure and stability of triangle-free set systems (Q3420310) (← links)
- 3-Uniform Hypergraphs and Linear Cycles (Q4638615) (← links)
- A hierarchy of maximal intersecting triple systems (Q4690989) (← links)
- Hypergraphs with no tight cycles (Q5055605) (← links)
- Turán numbers of sunflowers (Q5060342) (← links)
- Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems (Q5126774) (← links)
- Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs (Q5212951) (← links)
- Hypergraphs Not Containing a Tight Tree with a Bounded Trunk (Q5232133) (← links)
- Turán Problems and Shadows III: Expansions of Graphs (Q5254084) (← links)
