The following pages link to (Q4133991):
Displaying 24 items.
- Friendship 3-hypergraphs (Q427832) (← links)
- Counting substructures. II: Hypergraphs (Q485550) (← links)
- Bounding the number of hyperedges in friendship \(r\)-hypergraphs (Q499453) (← links)
- On finite set-systems whose every intersection is a kernel of a star (Q787982) (← links)
- Exact solution of some Turán-type problems (Q1112819) (← links)
- Extremal problems under dimension constraints. (Q1417564) (← links)
- Extremal set systems with restricted \(k\)-wise intersections. (Q1427014) (← links)
- The maximum size of 3-uniform hypergraphs not containing a Fano plane (Q1569074) (← links)
- On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances (Q1865379) (← links)
- On the Turán number of triple systems (Q1865386) (← links)
- Unavoidable hypergraphs (Q1984522) (← links)
- Ryser's conjecture for \(t\)-intersecting hypergraphs (Q2221906) (← links)
- On the co-degree threshold for the Fano plane (Q2441623) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Turán numbers of sunflowers (Q5060342) (← links)
- Almost-Fisher families (Q5890908) (← links)
- Almost-Fisher families (Q5899503) (← links)
- Some intersection theorems for structures (Q5904022) (← links)
- Intersection properties of subsets of integers (Q5904953) (← links)
- Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs (Q6046647) (← links)
- The maximum number of triangles in \(F_k\)-free graphs (Q6056558) (← links)
- Extremal Problems for Hypergraph Blowups of Trees (Q6057807) (← links)
- On the Turán density of uniform hypergraphs (Q6173977) (← links)
- Anti-Ramsey number of disjoint union of star-like hypergraphs (Q6197696) (← links)
