The splitting-set formula for the excessive 4-index of graphs
Statement
Let be an -coverable graph. For each , let denote the cardinality of a largest -splitting set of , where a -splitting set is a subgraph whose -matchings cannot be extended to an -matching of and which has an -matching. The splitting-set formula for the excessive 4-index. The excessive -index of should satisfy
This is the proposed graph analogue of the tree formula. The preceding example shows that the earlier formula involving only the ordinary chromatic index, the edge-count bound, and fails for a -coverable graph; the displayed conjecture adds the higher splitting-set obstructions and remains unresolved in the supplied text.
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.