For a graph , Schur positivity of implies that is strongly nice, and every strongly nice graph is nice. We construct three infinite families separating these properties. We first give a connected family , , that is strongly nice but not Schur positive. We then prove that homogeneous strongly nice symmetric functions with nonnegative monomial coefficients are closed under multiplication, and hence that strongly nice graphs are closed under disjoint union. As an application, for , the graphs form a disconnected family that is strongly nice but not Schur positive. Finally, we define and prove that every is connected and nice but not strongly nice. We also introduce the level- nice property and show that the level depth of is .

生成讲解博客的中文版本

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