The following pages link to (Q3348936):
Displayed 8 items.
- The minimum size of 3-graphs without a 4-set spanning no or exactly three edges (Q648971) (← links)
- A hypergraph Turán problem with no stability (Q2095110) (← links)
- Counting \(r\)-graphs without forbidden configurations (Q2171019) (← 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)
- An Unstable Hypergraph Problem with a Unique Optimal Solution (Q4915249) (← links)
- Semantic limits of dense combinatorial objects (Q5138464) (← links)