REVIEW 2 minor 2 cited by
A Schur-positivity classification for complete multipartite graphs
T0 review · 0 major / 2 minor · reviewed 2026-05-07 · grok-4.3
Pith's one-line read Complete multipartite graphs are Schur-positive precisely when their part sizes are all ones and twos or consist of a single three followed by any number of twos.
desk verdict This paper finishes the Schur-positivity classification for all complete multipartite graphs with an explicit if-and-only-if criterion. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
Special rim hook G-tabloids and the simpler incomparability-graph formula for Schur coefficients, applied after structural arguments have ruled out every other partition.
What would settle it
A single counterexample would be either a complete multipartite graph with a part of size four or larger whose chromatic symmetric function has all non-negative Schur coefficients, or an explicit computation showing a negative coefficient for some graph in the family K_{(3,2^β)}.
Extended reading notes
Core claim
A complete multipartite graph K_λ is Schur-positive if and only if either every part size λ_i belongs to {1,2} or λ equals (3,2^β) for some integer β ≥ 1.
Load-bearing premise
The structural arguments exclude every graph outside the two families without exception, and the rim-hook tabloid counts give the exact Schur coefficients for the surviving family.
Editorial extensions
If this is right
- The classification extends the earlier complete bipartite and complete tripartite results to arbitrary numbers of parts.
- The new incomparability-graph formula supplies a direct way to compute Schur coefficients for any incomparability graph.
- Non-negativity for the family K_{(3,2^β)} follows from an explicit non-negative counting interpretation via special rim-hook G-tabloids.
Reading between the lines
- Direct expansion of small examples from the (3,2^β) family could be used to spot-check the claimed non-negativity.
- The same combination of structural exclusion and rim-hook counting might be tried on other natural classes of graphs whose chromatic symmetric functions are not yet classified.
- Schur-positivity appears to be a rare property among complete multipartite graphs, occurring only inside these two infinite families.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper establishes a complete classification of Schur-positivity for complete multipartite graphs: K_λ is Schur-positive if and only if every part λ_i belongs to {1,2} or λ takes the form (3,2^β) for some β≥1. The proof proceeds by structural arguments that eliminate all other partitions, followed by an explicit combinatorial construction of special rim-hook G-tabloids that yields non-negative Schur coefficients precisely for the remaining family K_{(3,2^β)}; a simpler closed-form expression for the Schur coefficients of incomparability graphs is derived en route and applied to these cases.
Significance. If the structural elimination and the tabloid-based coefficient formula are correct, the result furnishes the first exhaustive Schur-positivity classification for all complete multipartite graphs, extending the known bipartite and tripartite cases. The new combinatorial formula for incomparability-graph coefficients and the explicit non-negativity construction for the (3,2^β) family constitute reusable tools for further work on chromatic symmetric functions.
minor comments (2)
- §3: the definition of a special rim-hook G-tabloid is introduced without an accompanying small illustrative example; adding one (e.g., for K_{(3,2)}) would clarify the subsequent counting argument.
- The statement of the simpler incomparability-graph formula (Theorem 4.2) would benefit from an explicit comparison table showing how it recovers known coefficients for the complete-bipartite case.
Simulated Author's Rebuttal
We thank the referee for their careful reading of the manuscript, for the accurate summary of our results, and for the positive recommendation to accept. We are pleased that the classification theorem, the structural arguments, the rim-hook tabloid construction, and the simplified formula for Schur coefficients of incomparability graphs are viewed as significant and reusable contributions.
Circularity Check
No significant circularity; derivation is self-contained
full rationale
The paper's classification rests on exhaustive structural arguments that rule out Schur-positivity for all but two families of complete multipartite graphs, followed by an explicit new combinatorial construction (special rim-hook G-tabloids) and a derived closed-form expression for the Schur coefficients of incomparability graphs. These steps introduce independent content rather than reducing the target positivity statement to a fitted parameter, self-definition, or load-bearing self-citation. The simpler incomparability-graph formula is established en route and then applied, with no equations or claims shown to be equivalent to their inputs by construction.
Assumptions & free parameters
Cite this review
Pith. "Pith review of A Schur-positivity classification for complete multipartite graphs." pith.science (2026). https://pith.science/paper/2604.26158
@misc{pith2026260426158,
author = {Pith},
title = {Pith review of: A Schur-positivity classification for complete multipartite graphs},
year = {2026},
howpublished = {\url{https://pith.science/paper/2604.26158}},
note = {Machine review of arXiv:2604.26158}
}
abstract
A graph is Schur-positive if its chromatic symmetric function expands non-negatively in the Schur basis. We determine a full Schur-positivity classification for complete multipartite graphs by showing that a complete multipartite graph $K_\lambda$ is Schur-positive if and only if either $\lambda_i\in \{1,2\}$ for all $i$ or $\lambda=(3,2^\beta)$ for some $\beta\ge 1$. These results extend earlier classifications for complete bipartite and complete tripartite graphs to full generality. Our proofs combine structural arguments ruling out most cases, with a combinatorial analysis of Schur coefficients for the remaining family $K_{(3,2^\beta)}$ via special rim hook $G$-tabloids. Along the way, we establish a simpler formula for Schur coefficients of incomparability graphs, which we then apply to compute the coefficients of interest in terms of non-increasing sequences.
Forward citations
Cited by 2 Pith papers
-
An $e$-positive classification for complete multipartite graphs
Every complete multipartite graph K(3,2^β) is e-positive, completing the e-positive classification for complete multipartite graphs.
-
Two infinite families of counterexamples to the Stanley--Gasharov conjecture
Claw-free graphs, already known to disprove the Stanley--Gasharov conjecture, are shown to yield infinitely many counterexamples in both line-graph and non-line-graph families, plus minimality of the base examples.
Reference graph
Works this paper leans on
-
[1]
[1]F. Aliniaeif ard, V. W ang, and S. v an Willigenburg,The chromatic sym- metric function of a graph centred at a vertex, Electronic Journal of Combinatorics, 31 (2024), pp. 1-34. [2]J. Aliste-Prieto, A. de Mier, R. Orellana, and J. Zamora,Marked graphs and the chromatic symmetric function, SIAM Journal on Discrete Mathematics, 37 (2023), pp. 1881-1919. ...
work page 2024
Reviewed May 7, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.