Salia's cycle-cover conjecture for infinite bipartite graphs
Salia's cycle-cover conjecture for infinite bipartite graphs
Let be a bipartite graph with sides and . For a subset with , let be the set of vertices having at least two neighbors in . The graph has the double Hall property if for every with .
Salia's conjecture. If has the double Hall property, then for every with there is a cycle in such that
The conjecture proposes that the double Hall condition is sufficient to find a cycle covering any prescribed finite or infinite subset of of size at least two, with no other vertices of on the cycle. The supplied text gives no resolution, so the conjecture is recorded as open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Leandro Aurichi, Paulo Magalhães Júnior and Lyubomyr Zdomskyy, “On cycle covers of infinite bipartite graphs”, arXiv:2504.02816 (2025).
Additional references
2 papers in this index state this conjecture (2025). The statement above is taken from the most recent of them; the others are arXiv:2502.10903.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.