ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TnT_n be a tree with bipartition (X1,X2)(X_1,X_2), where ∣Xi∣=qi|X_i|=q_i for i=1,2i=1,2. Write q=min⁡{q1,q2}q=\min\{q_1,q_2\}. Anti-labeling conjecture for trees. One has

mcnnh(Tn)=q.mc^{nh}_n(T_n)=q.

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 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.