Toughness and the existence of k-factors in hypergraphs

arXiv2304.14172MaRDI QIDQ6434554FDOQ6434554

Gexin Yu, Songling Shan, Yuping Gao

Publication date: 27 April 2023

Abstract: The study of existence of hamiltonian cycles and factors in graphs in terms of toughness was initiated by Chv'atal in 1973 and has been a popular topic since then. The study of Berge cycles and factor in hypergraphs has attracted quite a bit attention in recent years and much progress has been made in terms of conditions such as degrees. In this article, we propose to study toughness conditions for a hypergraph to have a Berge $k$-factor. Our main result is that every $k$-tough hypergraph $H$ has a Berge $k$-factor if $kcdot|V(H)|$ is even and $|V(H)|gek+1$ for integer $kge1$. This extends a similar result on graphs from 1985 by Enomoto, Jackson, Keterinis, and Saito.

This page was built for publication: Toughness and the existence of $k$-factors in hypergraphs

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