The following pages link to An exact result for 3-graphs (Q793054):
Displayed 35 items.
- A problem of Erdős and Sós on 3-graphs (Q273102) (← links)
- Small cores in 3-uniform hypergraphs (Q345139) (← links)
- A hypergraph Turán theorem via Lagrangians of intersecting families (Q388725) (← links)
- On the codegree density of complete 3-graphs and related problems (Q396955) (← links)
- Turán problems on non-uniform hypergraphs (Q470944) (← links)
- On set systems with a threshold property (Q856857) (← links)
- Constructions and bounds for \((m,t)\)-splitting systems (Q861791) (← links)
- On Turán densities of small triple graphs (Q896067) (← links)
- Constructions of non-principal families in extremal hypergraph theory (Q941382) (← links)
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent (Q1076037) (← links)
- Some Ramsey-Turán type results for hypergraphs (Q1111567) (← links)
- Exact solution of some Turán-type problems (Q1112819) (← links)
- Symmetry in Turán sums of squares polynomials from flag algebras (Q1637376) (← links)
- The codegree threshold of \(K_4^-\) (Q1689950) (← links)
- On the Turán number of triple systems (Q1865386) (← links)
- The Turán density of triple systems is not principal (Q1865388) (← links)
- An irrational Turán density via hypergraph Lagrangian densities (Q2088710) (← links)
- Counting \(r\)-graphs without forbidden configurations (Q2171019) (← links)
- Extremal problems in uniformly dense hypergraphs (Q2189833) (← links)
- Computation of maximal projection constants (Q2324733) (← links)
- Tournaments, 4-uniform hypergraphs, and an exact extremal result (Q2399352) (← links)
- Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\) (Q2461770) (← links)
- Codegree Thresholds for Covering 3-Uniform Hypergraphs (Q2826217) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- 3-uniform hypergraphs: modular decomposition and realization by tournaments (Q3303522) (← links)
- On the density of 2-colorable 3-graphs in which any four points span at most two edges (Q3576967) (← links)
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs (Q4903261) (← links)
- Almost similar configurations (Q4972058) (← links)
- Mantel's theorem for random hypergraphs (Q5740269) (← links)
- (Q5743377) (← links)
- Lagrangian-perfect hypergraphs (Q6084663) (← links)
- Uniform Turán density of cycles (Q6112889) (← links)
- Four-vertex traces of finite sets (Q6144497) (← links)
- Restricted problems in extremal combinatorics (Q6198640) (← links)
- Unavoidable order-size pairs in hypergraphs -- positive forcing density (Q6204681) (← links)