Hereditary characterization conjecture for cal G_k
Statement
Let be a positive integer, let be the graph class defined in the paper, and for a graph let denote the maximum number of pairwise vertex-disjoint -paths and let denote the minimum size of a vertex set meeting every -path. A subgraph need not be induced.
Hereditary characterization conjecture. For every positive integer , the set equals the set of all graphs such that
for every subgraph of .
The claim generalizes observations proved in the paper for . It gives a proposed characterization of through the equality of maximum -matchings and minimum -vertex covers in every subgraph, but remains open for general positive integer .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.