Liang's matching and node-disjoint link conjecture for subcubic bipartite graphs
Statement
Let be a bipartite graph. An -link is a path of length whose two endpoints lie in , and a family of -links is node-disjoint if no two links share a node. A matching is a set of pairwise nonincident edges.
Liang's conjecture. If every node in has degree at most and every node in has degree at most , then has a matching and a family of node-disjoint -links such that every node of degree is covered by an edge in
The conjecture was proposed as a tool toward antimagic edge labelings: it was known to imply that every -regular graph is antimagic. It is proved in the source, so the conjecture is solved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.