The Chromatic Symmetric Function of Graphs Glued at a Single Vertex
The Electronic Journal of Combinatorics · 14.04.2026 · 33 (2)
DOI: 10.37236/14403 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 14.04.2026. Verfasst von Foster Tom und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref).
Abstract (Originalsprache)
We describe how the chromatic symmetric function of two graphs glued at a single vertex can be expressed as a matrix multiplication using certain information of the two individual graphs. We then prove new $e$-positivity results by using a connection between forest triples, defined by the first author, and Hikita's probabilities associated to standard Young tableaux. Specifically, we prove that gluing a sequence of unit interval graphs and cycles results in an $e$-positive graph. We also prove $e$-positivity for a graph obtained by gluing the first and last vertices of such a sequence. This generalizes $e$-positivity of cycle-chord graphs and supports Ellzey's conjectured $e$-positivity for proper circular arc digraphs.
Zitieren
APA
Tom, F., & Vailaya, A. (2026). The Chromatic Symmetric Function of Graphs Glued at a Single Vertex. The Electronic Journal of Combinatorics, 33(2). https://doi.org/10.37236/14403
Vancouver
Tom F, Vailaya A. The Chromatic Symmetric Function of Graphs Glued at a Single Vertex. The Electronic Journal of Combinatorics. 2026;33(2). doi:10.37236/14403
BibTeX
@article{Tom2026,
author = {Tom, Foster and Vailaya, Aarush},
title = {The Chromatic Symmetric Function of Graphs Glued at a Single Vertex},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {2},
doi = {10.37236/14403}
}
EUVIMED