A class of constructions for Turan's (3,4)-problem
From MaRDI portal
Publication:1172651
DOI10.1007/BF02579317zbMath0502.05046OpenAlexW2031135370MaRDI QIDQ1172651
Publication date: 1982
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579317
Related Items
Unnamed Item ⋮ What we know and what we do not know about Turán numbers ⋮ Counting \(r\)-graphs without forbidden configurations ⋮ Turán, involution and shifting ⋮ On Turán numbers for disconnected hypergraphs ⋮ A 2-stable family of triple systems ⋮ Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm ⋮ The minimum size of 3-graphs without a 4-set spanning no or exactly three edges ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs ⋮ Method for construction of (3,4)-graphs ⋮ An Unstable Hypergraph Problem with a Unique Optimal Solution ⋮ Helly property in finite set systems ⋮ Connected Covering Numbers ⋮ On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem ⋮ A hypergraph Turán problem with no stability ⋮ An upper bound for the Turán number \(t_3(n,4)\) ⋮ On Turán's \((3,4)\)-problem with forbidden subgraphs ⋮ A new approach to Turán's conjecture
