1 problem

0 votes0 replies0 views
Set-weighted chromatic symmetric function coefficient-sum conjecture
Let $(G,\omega)$ be a set-weighted graph with $n$ vertices and total weight $d$ , and write … Let $\mu\leq d$ be an integer, viewed as a one-part partition, that is $s$ -allowable in…
Conjectureopenchromatic-symmetric-functions e-positivity graph-combinatoricsarXiv posted 2 days ago

Set-weighted chromatic symmetric function coefficient-sum conjecture