Hamiltonian chains in hypergraphs
From MaRDI portal
Publication:4237729
DOI<205::AID-JGT5>3.0.CO;2-O 10.1002/(SICI)1097-0118(199903)30:3<205::AID-JGT5>3.0.CO;2-OzbMath0924.05050OpenAlexW4244050075MaRDI QIDQ4237729
Gyula Y. Katona, Henry A. Kierstead
Publication date: 3 November 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199903)30:3<205::aid-jgt5>3.0.co;2-o
Related Items
Spanning surfaces in \(3\)-graphs ⋮ Hypergraph Extensions of the Erdős-Gallai Theorem ⋮ Bounds on the number of edges of edge-minimal, edge-maximal and \(l\)-hypertrees ⋮ Counting Hamilton cycles in Dirac hypergraphs ⋮ Extension of paths and cycles for hypergraphs ⋮ Bounds on the number of edges in hypertrees ⋮ Hamiltonian decompositions of prisms over complete 3-uniform hypergraphs ⋮ Unnamed Item ⋮ Perfect matchings in uniform hypergraphs with large minimum degree ⋮ Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree ⋮ Hamiltonian paths and cycles in some 4-uniform hypergraphs ⋮ Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs ⋮ The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph ⋮ Hamiltonian paths, unit-interval complexes, and determinantal facet ideals ⋮ On tight 6-cycle decompositions of complete 3-uniform hypergraphs ⋮ On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs ⋮ Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths ⋮ Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths ⋮ The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs ⋮ Monochromatic loose-cycle partitions in hypergraphs ⋮ On powers of tight Hamilton cycles in randomly perturbed hypergraphs ⋮ Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs ⋮ Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version ⋮ Saturation for the 3-uniform loose 3-cycle ⋮ Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles ⋮ On extremal hypergraphs for Hamiltonian cycles ⋮ Existence of the map \(det^{S^3}\) ⋮ Minimum degree conditions for tight Hamilton cycles ⋮ Unnamed Item ⋮ Loose Hamilton cycles in hypergraphs ⋮ Properly colored Hamilton cycles in Dirac-type hypergraphs ⋮ Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version ⋮ Hamilton saturated hypergraphs of essentially minimum size ⋮ Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees ⋮ Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ On the minimum size of Hamilton saturated hypergraphs ⋮ Forcing large tight components in 3-graphs ⋮ The Turán number for spanning linear forests ⋮ Rainbow connection for some families of hypergraphs ⋮ Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs ⋮ Families of triples with high minimum degree are Hamiltonian ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ An approximate Dirac-type theorem for \(k\)-uniform hypergraphs ⋮ Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version ⋮ On the Hamiltonicity of triple systems with high minimum degree ⋮ Extremal \(k\)-edge-Hamiltonian hypergraphs ⋮ An approximate Ore-type result for tight Hamilton cycles in uniform hypergraphs ⋮ Forbidding Hamilton cycles in uniform hypergraphs ⋮ Dirac-type results for loose Hamilton cycles in uniform hypergraphs ⋮ Hamilton-chain saturated hypergraphs ⋮ Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs ⋮ Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs ⋮ Unnamed Item ⋮ Large Sets of Wrapped K–K Hamilton Cycle Decompositions of Complete Bipartite 3‐Uniform Hypergraphs ⋮ Hamiltonian decompositions of complete \(k\)-uniform hypergraphs ⋮ Hamilton \(\ell \)-cycles in uniform hypergraphs ⋮ On extremal hypergraphs for forests of tight paths ⋮ Upper bounds on the minimum size of Hamilton saturated hypergraphs ⋮ On Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ Linear trees in uniform hypergraphs ⋮ Hamilton cycles in hypergraphs below the Dirac threshold ⋮ The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle ⋮ On Hamiltonian cycles in hypergraphs with dense link graphs ⋮ Hypergraph extensions of the Erdős-Gallai theorem ⋮ The Turán number of sparse spanning graphs ⋮ Hamilton cycles in quasirandom hypergraphs ⋮ Unnamed Item ⋮ Perfect matchings in large uniform hypergraphs with large minimum collective degree ⋮ Unnamed Item ⋮ Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs ⋮ Spectra of cycle and path families of oriented hypergraphs ⋮ Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs ⋮ Unnamed Item ⋮ A mathematical approach on representation of competitions: competition cluster hypergraphs ⋮ A note on minimum degree condition for Hamilton \((a,b)\)-cycles in hypergraphs ⋮ Constructions via Hamiltonian theorems ⋮ Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs ⋮ Extremal k-edge-hamiltonian Hypergraphs ⋮ Hamiltonian Chains in Hypergraphs ⋮ Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs ⋮ Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs ⋮ Constructing sparsest \(\ell\)-Hamiltonian saturated \(k\)-uniform hypergraphs for a wide range of \(\ell\) ⋮ Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs
