ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected triangle-free subcubic graph. Write calpha(G)calpha(G) for its independence number and diss(G){\rm diss}(G) for its dissociation number, the maximum cardinality of a vertex set inducing a graph of maximum degree at most one. The independence–dissociation conjecture. One has

α(G)≥58diss(G)−14.\alpha(G)\geq \frac{5}{8}{\rm diss}(G)-\frac{1}{4}.

The conjecture proposes a sharp factor for comparing the independence number and dissociation number in triangle-free subcubic graphs; the stated bound is not established in the supplied source context.

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.