Method for construction of (3,4)-graphs

DOI10.1007/BF01158925MaRDI QIDQ1195286zbMATH OpenOpenAlexFDO

Authors 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

(3,4)-graphhypergraph

Mathematics Subject Classification ID

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

Review text

See the review in Zbl 0727.05042.

Cites work

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

Cited in

(7)

• What we know and what we do not know about Turán numbers
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
• Semantic limits of dense combinatorial objects
• 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

This page was built for publication: Method for construction of (3,4)-graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1195286)