Method for construction of (3,4)-graphs

DOI10.1007/BF01158925zbMath0766.05061OpenAlexW2074815271MaRDI QIDQ1195286

Dmitry G. Fon-Der-Flaass

Publication date: 15 October 1992

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01158925

zbMATH Keywords

hypergraph(3,4)-graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items

What we know and what we do not know about Turán numbers ⋮ Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5‐cycles ⋮ On Turán numbers for disconnected hypergraphs ⋮ Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm ⋮ Semantic limits of dense combinatorial objects ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs

Cites Work

• A class of constructions for Turan's (3,4)-problem