It has been conjectured that for every tree of order at least three, where is the local antimagic chromatic number and denotes the number of leaves. We disprove this bound and show that no absolute constant can replace in an inequality of this form. Our approach uses degree-based intervals containing all possible induced vertex weights under bijective edge labelings, together with a separation criterion that forces selected internal vertex weights to be distinct. We first construct caterpillars and satisfying and , respectively. We then construct, for every positive integer , infinitely many pairwise nonisomorphic caterpillars with exactly internal vertices for which every bijective edge labeling is antimagic. Each such caterpillar satisfies . Consequently, is unbounded even within the class of caterpillars, and no absolute constant can satisfy for every tree .

生成讲解博客的中文版本

生成AI智能校验的中文版本