Chromatic Quasisymmetric Functions of the Path Graph
Abstract We show that the chromatic quasisymmetric function (CQF) of a labeled path graph on n vertices is not symmetric unless the labeling is the natural labeling $$1, 2,\ldots , n$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>,</mml:mo> <mml:mn>2</mml:mn> <mml:mo>,</mml:mo> <mml:mo>…</mml:mo> <mml:mo>,</mml:mo> <mml:mi>n</mml:mi> </mml:mrow> </mml:math> or its reverse $$n,\ldots , 2, 1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>,</mml:mo> <mml:mo>…</mml:mo> <mml:mo>,</mml:mo> <mml:mn>2</mml:mn> <mml:mo>,</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> . We also show that the star graph $$K_{1, n-1}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>K</mml:mi> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>,</mml:mo> <mml:mi>n</mml:mi> <mml:mo>-</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:msub> </mml:math> with $$n\ge 3$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>3</mml:mn> </mml:mrow> </mml:math> has a nonsymmetric CQF for all labelings.
Authors
- Maria S. Esipova
- Farid Aliniaeifard (ORCID: https://orcid.org/0000-0002-5672-5487)
- Stephanie van Willigenburg (ORCID: https://orcid.org/0000-0002-5340-5568)
- Shamil Asgarli (ORCID: https://orcid.org/0000-0003-3165-8297)
- Ethan Shelburne
- Tamsen Whitehead McGinley
Institutions
- Shandong University (CN)
- Santa Clara University (US)
Publication Details
- Journal
- Annals of Combinatorics
- Published
- 2025-05-26
- DOI
- https://doi.org/10.1007/s00026-025-00762-1
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Santa Clara University
- Natural Sciences and Engineering Research Council of Canada