Semistrong chromatic index bound beyond complete bipartite graphs
Statement
Let be a connected graph, let denote a complete bipartite graph, and let and denote the maximum degree and semistrong chromatic index of , respectively. Semistrong index improvement conjecture. If is distinct from , then
The paper proposes this improvement because its general bound is tight for complete bipartite graphs, while no other connected extremal family is known; its resolution is not given.
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.