Extension of paths and cycles for hypergraphs

DOI10.1016/J.ENDM.2013.11.002MaRDI QIDQ277496zbMATH OpenOpenAlexFDO

Authors Gyula Y. Katona

Publication date 29 April 2016

Full work available at URL http://real.mtak.hu/62093/1/katona_kashan_u.pdf

zbMATH Keywords

Hamiltonian cycletight cycletight path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Hypergraphs (05C65)

Recommendations

• scientific article; zbMATH DE number 5763213
• scientific article; zbMATH DE number 3966124
• Hamilton-chain saturated hypergraphs
• scientific article; zbMATH DE number 4027513
• scientific article; zbMATH DE number 125497

Cites work

• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• An approximate Dirac-type theorem for k-uniform hypergraphs
• Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
• Extremal \(k\)-edge-Hamiltonian hypergraphs
• Hamiltonian chains in hypergraphs
• Hypergraph extensions of the Erdős-Gallai theorem
• On extremal hypergraphs for Hamiltonian cycles
• On maximal paths and circuits of graphs
• Steiner system and large non-Hamiltonian hypergraphs

Cited in

(6)

• Paths and cycles of hypergraphs
• Homology cycles and dependent cycles of hypergraphs
• scientific article; zbMATH DE number 5919774 (Why is no real title available?)
• scientific article; zbMATH DE number 841659 (Why is no real title available?)
• Automata, Languages and Programming
• Extending cycles in directed graphs

This page was built for publication: Extension of paths and cycles for hypergraphs

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