Turán numbers of complete 3-uniform Berge-hypergraphs

DOI10.1007/s00373-018-1900-1zbMath1395.05120arXiv1612.08856OpenAlexW2562895083MaRDI QIDQ2413629

Maryam Shahsiah, Leila Maherani

Publication date: 14 September 2018

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Turán numberextremal hypergraphBerge-hypergraph

Mathematics Subject Classification ID

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

Related Items (6)

Extremal problems for the \(p\)-spectral radius of Berge hypergraphs ⋮ Induced Turán problems and traces of hypergraphs ⋮ On Ramsey numbers of 3-uniform Berge cycles ⋮ The Turán Number of Berge K_4 in Triple Systems ⋮ General lemmas for Berge-Turán hypergraph problems ⋮ Ramsey numbers of Berge-hypergraphs and related structures

Cites Work

• Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
• 3-uniform hypergraphs avoiding a given odd cycle
• Turán problems and shadows. I: Paths and cycles
• Hypergraph extensions of the Erdős-Gallai theorem
• Exact computation of the hypergraph Turán function for expanded complete 2-graphs
• Hypergraph Turán numbers of linear cycles
• A hypergraph extension of Turán's theorem
• Hypergraphs with No Cycle of a Given Length
• On maximal paths and circuits of graphs

This page was built for publication: Turán numbers of complete 3-uniform Berge-hypergraphs