On Hamiltonian Berge cycles in [3]-uniform hypergraphs
From MaRDI portal
Publication:2032885
DOI10.1016/j.disc.2021.112462zbMath1466.05152arXiv1901.06042OpenAlexW3164778531WikidataQ114190612 ScholiaQ114190612MaRDI QIDQ2032885
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
Berge cycle[3-uniform hypergraph]covering hypergraphHamiltonian Berge cyclehypergraph Lagrangian
Hypergraphs (05C65) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
On the cover Turán number of Berge hypergraphs, An irrational Turán density via hypergraph Lagrangian densities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- 3-uniform hypergraphs avoiding a given odd cycle
- Turán problems on non-uniform hypergraphs
- A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Polychromatic Hamilton cycles
- On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\)
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- On rainbow trees and cycles
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- Hypergraphs do not jump
- An Erdős-Gallai type theorem for uniform hypergraphs
- Multicoloured Hamilton cycles
- The structure of hypergraphs without long Berge cycles
- Avoiding long Berge cycles. II: Exact bounds for all \(n\)
- Super-pancyclic hypergraphs and bipartite graphs
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
- On \(r\)-uniform hypergraphs with circumference less than \(r\)
- Avoiding long Berge cycles
- On the density of families of sets
- Hypergraph Extensions of the Erdős-Gallai Theorem
- Hypergraphs with No Cycle of a Given Length
- Properly coloured copies and rainbow copies of large graphs with small maximum degree
- Recent advances on Dirac-type problems for hypergraphs
- Lagrangians of Hypergraphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Hamiltonian chains in hypergraphs
- A Rainbow Dirac's Theorem
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Extremal Results for Berge Hypergraphs
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Some Theorems on Abstract Graphs
