chromatic symmetric function 1claw-free graphs 1counterexample 1graph enumeration 1schur-positivity 1
From the 1 of 3 linked papers with an AI index.
3 papers
cs.IT2026
A counterexample to the Etzion-Silberstein conjecture
Jitendra Prajapati
The Etzion-Silberstein conjecture asserts that the Singleton-type upper bound for linear Ferrers-diagram rank-metric codes is attained for every Ferrers diagram, minimum rank dista…
math.CO2026
An explicit construction of two completely independent spanning trees in the four-dimensional dual-cube
Jitendra Prajapati
Lalou, Mbarek, Skender and Togni (arXiv:2607.25917) proved that the -dimensional dual-cube admits two completely independent spanning trees for every , observed th…
math.CO2026
A counterexample to the claw-free Schur-positivity conjecture
Jitendra Prajapati
The paper presents a 12‑vertex claw‑free graph whose chromatic symmetric function is not Schur‑positive, providing the smallest known counterexample to the claw‑free Schur‑positivi…