Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2508.17682

On graphs with equal and different Kromatic symmetric functions

Laura Pierson·Soham Samanta
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Kromatic symmetric function (KSF) $\overline{X}_G$ of a graph $G$ is a $K$-analogue introduced by Crew, Pechenik, and Spirkl in arXiv:2301.02177 of Stanley's chromatic symmetric function (CSF) $X_G$. The KSF is known to distinguish some pairs of graphs with the same CSF. The first author showed in arXiv:2403.15929 and arXiv:2502.21285 that the number of copies in $G$ of certain induced subgraphs can be determined given $\overline{X}_G$, and conjectured that $\overline{X}_G$ distinguishes all graphs. We disprove that conjecture by finding four pairs of 8-vertex graphs with equal KSF, as well as giving several ways to use existing graph pairs with equal KSF to construct larger graph pairs that also have equal KSF. On the other hand, we show that many of the graph pairs from the constructions of Orellana and Scott in arXiv:1308.6005 and of Aliste-Prieto, Crew, Spirkl, and Zamora in arXiv:2007.11042 of graphs with the same CSF are distinguished by the KSF, thus also giving some new examples of cases where the KSF is a stronger invariant than the CSF.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Laura Pierson, Soham Samanta. 2025-10-02. On graphs with equal and different Kromatic symmetric functions. https://arxiv.org/abs/2508.17682

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↗