ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected subcubic graph, let n(G)n(G) denote its number of vertices, and let uac(G) u_{ac}(G) denote its acyclic matching number. The acyclic matching conjecture. There is a constant cc such that

νac(G)≥3n(G)11−c\nu_{ac}(G) \geq \frac{3n(G)}{11}-c

for every connected subcubic graph GG. The conjecture would be asymptotically best possible, as the paper describes a family of connected subcubic graphs GkG_k satisfying νac(Gk)=3n(Gk)/11\nu_{ac}(G_k)=3n(G_k)/11; its resolution is not indicated here.

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.