Book free 3-uniform hypergraphs

DOI10.1016/J.DISC.2023.113828MaRDI QIDQ6177430zbMATH OpenOpenAlexFDO

Authors Debarun Ghosh, Ervin Győri, Judit Nagy-György, Addisu Paulos, Chuanqi Xiao, Oscar Zamora

Publication date 17 January 2024

Published in Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

extremal problemshypergraphsTuran type problems

Mathematics Subject Classification ID

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

Abstract: One of the first problems in extremal graph theory was the maximum number of edges that a triangle-free graph can have. Mantel solved this, which built the foundations of what we know as extremal graph theory. The natural progression was to ask the maximum number of edges in a $k$-book free graph. A $k$-book, denoted by $B_k$, is $k$ triangles sharing a common edge. In the early 2000s, GyH{o}ri cite{gyori1} solved the hypergraph analog of the maximum number of hyperedges in a triangle-free hypergraph. In a hypergraph, $k$-book denotes $k$ Berge triangles sharing a common edge. Let $ext{ex}_3(n,mathcalF)$ denote the maximum number of hyperedges in a Berge-$mathcalF$-free hypergraph on $n$ vertices. In this paper, we prove $ext{ex}_3(n,B_k)=frac{n}^{2}8(1+o(1))$.

Recommendations

• The Turán number of Berge book hypergraphs
• 4-books of three pages
• On 3-uniform hypergraphs without a cycle of a given length
• On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
• Books versus triangles

Cites work

• A note on Ramsey numbers for Berge-\(G\) hypergraphs
• Cycles of given lengths in hypergraphs
• scientific article; zbMATH DE number 3659602 (Why is no real title available?)
• scientific article; zbMATH DE number 3609704 (Why is no real title available?)
• Hypergraph extensions of the Erdős-Gallai theorem
• On a theorem of Rademacher-Turán
• On hypergraphs of girth five
• On maximal paths and circuits of graphs
• Pentagons vs. triangles
• Triangle-Free Hypergraphs

Cited in

(4)

• A stability result for Berge-\( K_{3 , t}r\)-graphs and its applications
• The Turán number of Berge book hypergraphs
• A note on stability results for Berge-\( K_{s , t}\) hypergraphs
• Turán problem for Berge disjoint cycles in hypergraphs

This page was built for publication: Book free 3-uniform hypergraphs

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