Minimum degree ensuring that a hypergraph is Hamiltonian-connected
From MaRDI portal
Publication:6080369
DOI10.1016/j.ejc.2023.103782zbMath1522.05347arXiv2207.14794OpenAlexW4385896089MaRDI QIDQ6080369
Alexandr V. Kostochka, Grace McCourt, Ruth Luo
Publication date: 2 October 2023
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.14794
Cites Work
This page was built for publication: Minimum degree ensuring that a hypergraph is Hamiltonian-connected