The double Hall path-cover conjecture

About 1 year old · traced to

Let G=(X,Y)G=(X,Y) be a dHp bigraph. Write ΛG(X)\mathsf{\Lambda}_G(X) for the neighborhood of XX in YY, and let a YY-YY path be a path whose two endpoints lie in YY.

Double Hall path-cover conjecture. If

∣ΛG(X)∣≥∣X∣+1,|\mathsf{\Lambda}_G(X)|\geq |X|+1,

then there exists a collection of disjoint YY-YY paths whose union covers all of XX.

The paper presents this as a conjecture weaker than Salia's cycle conjecture and proves that it is equivalent to another such weakening. Its general status is open.

References

Primary source

Guantao Chen, Mikhail Lavrov, Yuying Ma, Yimo Su and Jennifer Vandenbussche, “Bipartite graphs with the double Hall property”, arXiv:2502.10903 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.