The following pages link to Turán \(H\)-densities for 3-graphs (Q456381):
Displaying 15 items.
- A problem of Erdős and Sós on 3-graphs (Q273102) (← links)
- New Turán densities for 3-graphs (Q426895) (← links)
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle (Q896063) (← links)
- On Turán densities of small triple graphs (Q896067) (← links)
- Maximum density of vertex-induced perfect cycles and paths in the hypercube (Q1981712) (← links)
- Paths of length three are \(K_{r+1}\)-Turán-good (Q2121716) (← links)
- Minimum number of edges that occur in odd cycles (Q2312602) (← links)
- Rainbow triangles in three-colored graphs (Q2399351) (← links)
- Tournaments, 4-uniform hypergraphs, and an exact extremal result (Q2399352) (← links)
- On the exact maximum induced density of almost all graphs and their inducibility (Q2421550) (← links)
- The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm (Q4611853) (← links)
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs (Q4903261) (← links)
- On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs (Q6098458) (← links)
- Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm (Q6133947) (← links)
- The inducibility of oriented stars (Q6564603) (← links)
