2 papers
math.CO2026
Berge -Factors of Regular Hypergraphs
Mikio Kano, Shun-ichi Maezawa, Akira Saito +1
A Berge -factor in a hypergraph is a generalization of a -factor in a graph. In this paper, we study the problem of determining the values such that every -edge-conne…
math.CO2025
Spanning path-cycle systems with given end-vertices in regular graphs (full version)
Yoshimi Egawa, Mikio Kano, Kenta Ozeki
We prove the following theorem. Let be an integer, and be a -free -edge-connected -regular graph. Then, for every set of even number of vertices of…