3-uniform hypergraphs without a cycle of length five

DOI10.37236/8806MaRDI QIDQ2182003zbMATH OpenOpenAlexFDO

Authors Beka Ergemlidze, Abhishek Methuku, Ervin Győri

Publication date 20 May 2020

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

Copyright license Creative Commons Attribution 4.0 International

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

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

zbMATH Keywords

Berge cyclemaximum number of hyperedges

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Hypergraphs (05C65)

Abstract: In this paper we show that the maximum number of hyperedges in a $3$-uniform hypergraph on $n$ vertices without a (Berge) cycle of length five is less than $(0.254+o(1))n^{3/2}$, improving an estimate of Bollob'as and GyH{o}ri. We obtain this result by showing that not many $3$-paths can start from certain subgraphs of the shadow.

Review text

The paper improves an earlier upper bound on the number of hyperedges in a 3-uniform hypergraph on \(n\) vertices without Berge cycles of length 5. The proof examines certain subgraphs of the shadow graph.

Recommendations

• On 3-uniform hypergraphs without a cycle of a given length
• On 3-uniform hypergraphs without linear cycles
• 3-uniform hypergraphs avoiding a given odd cycle
• On coloring uniform hypergraphs without 3-cycles
• 3-uniform hypergraphs and linear cycles
• 3-uniform hypergraphs and linear cycles
• Cycle decompositions in 3-uniform hypergraphs
• scientific article; zbMATH DE number 2149839
• Hypergraphs with no cycle of a given length
• An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three

Cites work

• 3-uniform hypergraphs avoiding a given odd cycle
• A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
• Asymptotics for the Turán number of Berge-\(K_{2,t}\)
• Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
• Cycles of given lengths in hypergraphs
• Extremal results for Berge hypergraphs
• General lemmas for Berge-Turán hypergraph problems
• scientific article; zbMATH DE number 3609704 (Why is no real title available?)
• Hypergraphs with no cycle of a given length
• On 3-uniform hypergraphs without a cycle of a given length
• On \(r\)-uniform hypergraphs with circumference less than \(r\)
• On hypergraphs of girth five
• Pentagons vs. triangles
• The structure of hypergraphs without long Berge cycles
• The Turán Number of Berge K₄ in Triple Systems
• Triangle-Free Hypergraphs
• Turán numbers for Berge-hypergraphs and related extremal problems
• Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs

Cited in

(10)

• 3-uniform hypergraphs and linear cycles
• Hypergraphs with no odd cycle of given length
• Hypergraphs with no cycle of a given length
• 3-uniform hypergraphs avoiding a given odd cycle
• 3-uniform hypergraphs and linear cycles
• A note on the Turán number of a Berge odd cycle
• On 3-uniform hypergraphs without a cycle of a given length
• On 3-uniform hypergraphs without linear cycles
• On \(3\)-uniform hypergraphs avoiding a cycle of length four
• Pentagons vs. triangles

This page was built for publication: 3-uniform hypergraphs without a cycle of length five

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