Hamilton cycles in line graphs of 3-hypergraphs

DOI10.1016/J.DISC.2022.113028MaRDI QIDQ2144607zbMATH OpenOpenAlexFDO

Authors Tomáš Kaiser, Petr Vrána

Publication date 14 June 2022

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

3-hypergraphHamilton cycleline graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Hypergraphs (05C65) Graph operations (line graphs, products, etc.) (05C76)

Abstract: We prove that every 52-connected line graph of a rank 3 hypergraph is Hamiltonian. This is the first result of this type for hypergraphs of bounded rank other than ordinary graphs.

Review text

The authors prove that a 52-connected line graph of a rank 3 hypergraph is Hamiltonian.

Recommendations

• Hamilton cycles in 5-connected line graphs
• Thomassen's conjecture for line graphs of 3-hypergraphs
• Every 3-connected essentially 10-connected line graph is Hamilton-connected
• scientific article; zbMATH DE number 3966124
• Hamiltonicity of 3-connected line graphs

Cites work

• A Theorem on Planar Graphs
• An approximate max-Steiner-tree-packing min-Steiner-cut theorem
• Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
• Graph theory
• Hamilton cycles in 5-connected line graphs
• Hamiltonian results inK1,3-free graphs
• Hamiltonicity for K_{1, r}‐free graphs
• How many conjectures can you stand? A survey
• scientific article; zbMATH DE number 68918 (Why is no real title available?)
• Not every 2-tough graph is Hamiltonian
• On a closure concept in claw-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Packing of Steiner trees and \(S\)-connectors in graphs
• Packing Steiner trees
• Reflections on graph theory
• Thomassen's conjecture for line graphs of 3-hypergraphs
• Tough graphs and Hamiltonian circuits.

Cited in

(5)

• Quasigraphs and skeletal partitions
• Hamiltonian cycles in spanning subgraphs of line graphs
• scientific article; zbMATH DE number 3966124 (Why is no real title available?)
• Hamilton cycles in the line graph of a random hypergraph
• Spectral radius and Hamiltonicity in split graphs

This page was built for publication: Hamilton cycles in line graphs of 3-hypergraphs

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