3-uniform hypergraphs without a cycle of length five

DOI10.37236/8806zbMATH Open1444.05100arXiv1902.06257OpenAlexW3021566167MaRDI QIDQ2182003FDOQ2182003

Abhishek Methuku, Beka Ergemlidze, Ervin Győri

Publication date: 20 May 2020

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

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.

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

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

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

zbMATH Keywords

Berge cyclemaximum number of hyperedges

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• On 3-uniform hypergraphs without linear cycles
• Pentagons vs. triangles
• A note on the Tur\'an number of a Berge odd cycle
• On \(3\)-uniform hypergraphs avoiding a cycle of length four
• On 3-uniform hypergraphs without a cycle of a given length

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)