ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a 3-connected cubic graph of order nn, and let ml(G)\mathrm{ml}(G) denote its minimum leaf number. Minimum-leaf conjecture for 3-connected cubic graphs.

ml(G)≤⌈n16+12⌉.\mathrm{ml}(G)\leq\left\lceil\frac{n}{16}+\frac12\right\rceil.

The conjecture is presented as open; constructions in the paper are intended to show that the bound is sharp.

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.