REVIEW 1 cited by
Strongly nice property and Schur positivity of graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Motivated by the notion of nice graphs, we introduce the concept of strongly nice property, which can be used to study the Schur positivity of symmetric functions. We show that a graph and all its induced subgraphs are strongly nice if and only if it is claw-free, which strengthens a result of Stanley and provides further evidence for the well-known conjecture on the Schur positivity of claw-free graphs. As another application, we solve Wang and Wang's conjecture on the non-Schur positivity of squid graphs $Sq(2n-1;1^n)$ for $n \ge 3$ by proving that these graphs are not strongly nice.
Forward citations
Cited by 1 Pith paper
-
Exact thresholds for Schur positivity of the lattices $\mathbf m\times\mathbf 2$ and $\mathbf m\times\mathbf 3$
The chain-product lattices m×2 and m×3 are Schur positive exactly for m≤7 and m≤6, with explicit negative Schur coefficients proving non-Schur-positivity for m≥8.
Discussion (0). Sign in to comment.