scientific article; zbMATH DE number 4200246

MaRDI QIDQ3348936zbMATH OpenFDO

Authors Dmitry G. Fon-Der-Flaass

Publication date 1988

Full work available at URL http://mathnet.ru/eng/mz/v44/i4/p546

zbMATH Keywords

hypergraph(3,4)-graph

Mathematics Subject Classification ID

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

Recommendations

• More constructions for Turan's (3,4)-conjecture
• scientific article; zbMATH DE number 3869379
• scientific article; zbMATH DE number 4112627
• An upper bound for the Turán number \(t_3(n,4)\)
• On Turán numbers of the complete 4-graphs

Cited in

(16)

• A 2-stable family of triple systems
• Semantic limits of dense combinatorial objects
• The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
• Finite hypergraph families with rich extremal Turán constructions via mixing patterns
• On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem
• When entropy meets Turán: new proofs and hypergraph Turán results
• scientific article; zbMATH DE number 4112627 (Why is no real title available?)
• An unstable hypergraph problem with a unique optimal solution
• More constructions for Turan's (3,4)-conjecture
• scientific article; zbMATH DE number 3869379 (Why is no real title available?)
• Counting \(r\)-graphs without forbidden configurations
• Turán, involution and shifting
• A hypergraph Turán problem with no stability
• Principal eigenvectors in hypergraph Turán problems
• Non-degenerate hypergraphs with exponentially many extremal constructions
• On Turán's \((3,4)\)-problem with forbidden subgraphs

This page was built for publication:

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