An exact Turán result for tripartite 3-graphs

zbMath1323.05076arXiv1504.07796MaRDI QIDQ888608

John Talbot, Adam Sanitt

Publication date: 2 November 2015

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

Full work available at URL: https://arxiv.org/abs/1504.07796

zbMATH Keywords

hypergraphsextremal graph theory

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• New Turán densities for 3-graphs
• Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
• Three-graphs without two triples whose symmetric difference is contained in a third
• Stability theorems for cancellative hypergraphs
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• Flag algebras
• On the structure of linear graphs
• A new generalization of the Erdős-Ko-Rado theorem

This page was built for publication: An exact Turán result for tripartite 3-graphs