ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(S,T;E)G=(S,T;E) be a bipartite graph. An SS-link is a path of length 22 whose two endpoints lie in SS, and a family of SS-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 SS has degree at most 44 and every node in TT has degree at most 33, then GG has a matching MM and a family F\mathcal{F} of node-disjoint SS-links such that every node v∈Tv\in T of degree 33 is covered by an edge in

M∪(⋃P∈FP).M\cup\left(\bigcup_{P\in\mathcal{F}}P\right).

The conjecture was proposed as a tool toward antimagic edge labelings: it was known to imply that every 44-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.