加载中…
Csikvári constructed a poset on trees to prove that several graph functions attain extreme values at the star and the path among the trees on a fixed number of vertices. Reiner and Smith proved that the Tutte polynomials of cones over trees, which are the graphs obtained by attaching a cone vertex to a tree, have the described extreme behavior. They further conjectured that the result can be strengthened in terms of Csikvári’s poset. We solve this conjecture affirmatively.

生成讲解博客的中文版本

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