Pages that link to "Item:Q648971"
From MaRDI portal
The following pages link to The minimum size of 3-graphs without a 4-set spanning no or exactly three edges (Q648971):
Displaying 11 items.
- A problem of Erdős and Sós on 3-graphs (Q273102) (← links)
- Mini-workshop: Hypergraph Turán problem. Abstracts from the mini-workshop held April 8--14, 2012. (Q343331) (← links)
- Maximizing five-cycles in \(K_r\)-free graphs (Q2048348) (← links)
- Paths of length three are \(K_{r+1}\)-Turán-good (Q2121716) (← links)
- Counting \(r\)-graphs without forbidden configurations (Q2171019) (← links)
- Minimum number of edges that occur in odd cycles (Q2312602) (← links)
- On Turán's \((3,4)\)-problem with forbidden subgraphs (Q2341979) (← links)
- Turán, involution and shifting (Q2421565) (← links)
- On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem (Q2510770) (← links)
- Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5‐cycles (Q6081569) (← links)
- Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm (Q6133947) (← links)
