ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk be a positive integer, let Gk{\cal G}_k be the graph class defined in the paper, and for a graph HH let νk(H)\nu_k(H) denote the maximum number of pairwise vertex-disjoint kk-paths and let τk(H)\tau_k(H) denote the minimum size of a vertex set meeting every kk-path. A subgraph need not be induced.

Hereditary characterization conjecture. For every positive integer kk, the set Gk{\cal G}_k equals the set of all graphs GG such that

νk(H)=τk(H)\nu_k(H)=\tau_k(H)

for every subgraph HH of GG.

The claim generalizes observations proved in the paper for k∈{1,2,3,4}k\in\{1,2,3,4\}. It gives a proposed characterization of Gk{\cal G}_k through the equality of maximum kk-matchings and minimum kk-vertex covers in every subgraph, but remains open for general positive integer kk.

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.