More constructions for Turan's (3,4)-conjecture

MaRDI QIDQ1010873zbMATH OpenFDO

Authors Andrew Frohmader

Publication date 7 April 2009

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0806.4208, https://eudml.org/doc/117278, http://www.emis.de/journals/EJC/Volume_15/Abstracts/v15i1r137.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

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

Abstract: For Tur'an's (3, 4)-conjecture, in the case of n = 3k+1 vertices, (.5)6^{k-1} non-isomorphic complexes are constructed that attain the conjecture. In the case of n = 3k+2 vertices, 6^{k-1} non-isomorphic complexes are constructed that attain the conjecture.

Recommendations

• scientific article; zbMATH DE number 4200246
• scientific article; zbMATH DE number 3869379
• A new approach to Turán's conjecture
• An exact Turán result for the generalized triangle
• scientific article; zbMATH DE number 796185

Cited in

(8)

• Finite hypergraph families with rich extremal Turán constructions via mixing patterns
• Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm
• An unstable hypergraph problem with a unique optimal solution
• The Turán polytope
• Counting \(r\)-graphs without forbidden configurations
• Turán, involution and shifting
• Principal eigenvectors in hypergraph Turán problems
• Non-degenerate hypergraphs with exponentially many extremal constructions

This page was built for publication: More constructions for Turan's (3,4)-conjecture

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