On Hamiltonian Berge cycles in [3]-uniform hypergraphs

DOI10.1016/J.DISC.2021.112462MaRDI QIDQ2032885zbMATH OpenOpenAlexWikidataFDO

Authors Linyuan Lu, Zhiyu Wang

Publication date 14 June 2021

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

[3-uniform hypergraph]Berge cyclecovering hypergraphHamiltonian Berge cyclehypergraph Lagrangian

Mathematics Subject Classification ID

Paths and cycles (05C38) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: Given a set $R$, a hypergraph is $R$-uniform if the size of every hyperedge belongs to $R$. A hypergraph $mathcalH$ is called extit{covering} if every vertex pair is contained in some hyperedge in $mathcalH$. In this note, we show that every covering $[3]$-uniform hypergraph on $ngeq6$ vertices contains a Berge cycle $C_s$ for any $3leqsleqn$. As an application, we determine the maximum Lagrangian of $k$-uniform Berge-$C_t$-free hypergraphs and Berge-$P_t$-free hypergraphs.

Recommendations

• On 3-uniform hypergraphs without a cycle of a given length
• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
• The 3-colour Ramsey number of a 3-uniform Berge cycle
• On the cover Turán number of Berge hypergraphs
• Hamiltonian Berge cycles in random hypergraphs

Cites work

• 3-uniform hypergraphs avoiding a given odd cycle
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs
• A rainbow Dirac's theorem
• An approximate Dirac-type theorem for k-uniform hypergraphs
• An Erdős-Gallai type theorem for uniform hypergraphs
• Avoiding long Berge cycles
• Avoiding long Berge cycles. II: Exact bounds for all \(n\)
• Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• Extremal results for Berge hypergraphs
• Hamilton \(\ell \)-cycles in uniform hypergraphs
• Hamiltonian chains in hypergraphs
• scientific article; zbMATH DE number 5942358 (Why is no real title available?)
• scientific article; zbMATH DE number 3825881 (Why is no real title available?)
• scientific article; zbMATH DE number 3641483 (Why is no real title available?)
• Hypergraph extensions of the Erdős-Gallai theorem
• Hypergraphs do not jump
• Hypergraphs with no cycle of a given length
• Lagrangians of Hypergraphs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
• Multicoloured Hamilton cycles
• On \(r\)-uniform hypergraphs with circumference less than \(r\)
• On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\)
• On rainbow trees and cycles
• On the density of families of sets
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
• Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
• Polychromatic Hamilton cycles
• Properly coloured copies and rainbow copies of large graphs with small maximum degree
• Recent advances on Dirac-type problems for hypergraphs
• Some Theorems on Abstract Graphs
• Super-pancyclic hypergraphs and bipartite graphs
• The structure of hypergraphs without long Berge cycles
• Turán problems on non-uniform hypergraphs

Cited in

(6)

• On the cover Turán number of Berge hypergraphs
• An irrational Turán density via hypergraph Lagrangian densities
• Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs
• Hamiltonicity and $\sigma$-hypergraphs
• A Hall-type condition for path covers in bipartite graphs
• Berge pancyclic hypergraphs

This page was built for publication: On Hamiltonian Berge cycles in [3]-uniform hypergraphs

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