Pages that link to "Item:Q1172651"
From MaRDI portal
The following pages link to A class of constructions for Turan's (3,4)-problem (Q1172651):
Displaying 18 items.
- The minimum size of 3-graphs without a 4-set spanning no or exactly three edges (Q648971) (← links)
- A new approach to Turán's conjecture (Q1066899) (← links)
- Method for construction of (3,4)-graphs (Q1195286) (← links)
- Helly property in finite set systems (Q1208035) (← links)
- An upper bound for the Turán number \(t_3(n,4)\) (Q1304632) (← links)
- What we know and what we do not know about Turán numbers (Q1895823) (← 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)
- (Q2713359) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs (Q4903261) (← links)
- An Unstable Hypergraph Problem with a Unique Optimal Solution (Q4915249) (← links)
- Connected Covering Numbers (Q5744163) (← links)
- On Turán numbers for disconnected hypergraphs (Q6111798) (← links)
- Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm (Q6133947) (← links)