Anti-labeling conjecture for trees
Statement
Let be a tree with bipartition , where for . Write . Anti-labeling conjecture for trees. One has
This conjecture asserts that the no-hole anti-labeling maximum for every tree equals the size of its smaller bipartition class; the paper establishes the corresponding lower bound and gives examples attaining it as an upper bound.
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.