Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.26364

A counterexample to the claw-free Schur-positivity conjecture

Jitendra Prajapati
View original source ↗Read source document ↗Export metadata ↓

Abstract

The claw-free Schur-positivity conjecture, recorded by Stanley (1998) and credited there to Gasharov, asserts that the chromatic symmetric function of every claw-free graph is Schur-positive. We give a counterexample on 12 vertices: the line graph $G$ of the graph obtained from a 4-cycle by attaching triangles at two opposite vertices and pendant edges at the other two satisfies $[s_{(3,3,3,3)}]X_G = -64$. The coefficient follows from a short computation by hand and is also reproduced by three exact implementations. An exhaustive computation over all 216,777 connected claw-free graphs on at most 11 vertices shows that every one is Schur-positive, so 12 vertices is the minimum order of any counterexample. A complete census of the 1,728,404 connected claw-free graphs on 12 vertices finds exactly two non-Schur-positive isomorphism classes; the other has graph6 code K?`CR@`bAbRB and coefficient $[s_{(3,3,3,3)}] = -40$.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jitendra Prajapati. 2026-08-22. A counterexample to the claw-free Schur-positivity conjecture. https://arxiv.org/abs/2607.26364

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗