ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an [4][4]-coverable graph. For each tt, let st(G)s^t(G) denote the cardinality of a largest tt-splitting set of GG, where a tt-splitting set is a subgraph whose [t+1][t+1]-matchings cannot be extended to an [4][4]-matching of GG and which has an [t+1][t+1]-matching. The splitting-set formula for the excessive 4-index. The excessive [4][4]-index of GG should satisfy

χ[4]′(G)=max⁡{χ′(G),⌈∣E(G)∣/4⌉,s1(G),⌈s2(G)/2⌉,⌈s3(G)/3⌉}.\chi'_{[4]}(G)=\max\{\chi'(G),\lceil |E(G)| / 4 \rceil,s^1(G),\lceil s^2(G) / 2 \rceil, \lceil s^{3}(G) / 3 \rceil\}.

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 s(G)s(G) fails for a [4][4]-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 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.