Sink polynomials of line graphs and weighted matching polynomials

Per Alexandersson; Leonardo Saud Maia Leite

Home/Archive/arXiv

arXiv · 2610.41502

Sink polynomials of line graphs and weighted matching polynomials

Per Alexandersson·Leonardo Saud Maia Leite

View original source ↗Read source document ↗Export metadata ↓

Abstract

Chromatic quasisymmetric functions and unicellular LLT polynomials give symmetric-function interpretations of graph orientations counted by sinks. For natural unit interval graphs, we prove that the acyclic sink polynomial is real-rooted for every nonnegative ascent weight. Equivalently, the elementary coefficients of the chromatic quasisymmetric function, grouped by partition length, form a real-rooted polynomial. The Carlsson--Mellit relation expresses this polynomial as a plethystic specialization of the corresponding LLT polynomial, and the Hessenberg correspondence gives an interpretation in cohomology. More generally, the acyclic sink polynomial is real-rooted for chordal claw-free graphs, and the all-orientations sink polynomial is real-rooted for every claw-free graph. We also study a real-rooted polynomial counting joint minima in local edge orders. It agrees with the acyclic sink polynomial of the line graph exactly for forests. An exact formula for unicyclic roots gives a line-graph counterexample to acyclic sink real-rootedness.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Per Alexandersson, Leonardo Saud Maia Leite. 2026-10-30. Sink polynomials of line graphs and weighted matching polynomials. https://arxiv.org/abs/2610.41502

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

KEEP EXPLORING

Related papers

arXiv2026

Connected Dominating Sets in Triangulations

A dominating set of a graph $G$ is \emph{connected} if it induces a connected graph in $G$. For planar triangulations, it has been known since 1990 that every $n$-vertex triangulation with $n\ge4$ admits a connected dominating set of size at most $n/2 - 1$, and no improvement to this bound was known for over three decades. We break this longstanding barrier by showing that every $n$-vertex triangulation has a connected dominating set of size at most $10n/21$. Equivalently, every triangulation admits a spanning tree with at least $11n/21$ leaves. This result has graph drawing applications, establishing a bound for one-bend free sets and improving the known bound for simultaneous planar embeddings. The connected dominating set results extend readily to show that an $n$-vertex triangulation of a surface of Euler genus $g$ has a connected dominating set of size at most $10n/21+O(\sqrt{gn})$.

math.CO↗

arXiv2026

Curves on the torus with few intersections

Aougab and Gaster [Math. Proc. Cambridge Philos. Soc. 174 (2023), 569-584] proved that any set of simple closed curves on the torus, where any two are non-homotopic and intersect at most k times, has a maximum size of $k+O(\sqrt{k}\log k)$. We determine the maximum size of such a set for every k. In particular, the maximum never exceeds k+6, and it does not exceed k+4 when k is large. As this quantity coincides with the maximal number of columns of a generic k-modular matrix with two rows, our result also settles the column number problem, a problem of interest in combinatorial optimization, for such matrices.

math.CO↗

arXiv2026

Spectral extrema on closed surfaces of fixed Euler genus

We investigate a classical extremal problem in combinatorics and topological graph theory: determining the maximum spectral radius $spex(n,γ)$ of all $n$-vertex graphs embeddable on a closed surface of Euler genus $γ$. Building on seminal contributions by Boots and Royle, Cao and Vince, and Hong in the 1990s; Ellingham and Zha in 2000; Dvořák and Mohar in 2010; Tait and Tobin in 2017; and Liu, Ning, and Wang in 2026, we provide a complete characterization of spectral extremal graphs for any fixed Euler genus $γ$ and all sufficiently large $n$. The extremal graph attaining $\operatorname{spex}(n,γ)$ is unique, necessarily edge-extremal, and, roughly speaking, is constructed from the join $K_2 \nabla P_{n-2}$ by adding exactly $3γ$ edges. As a consequence, we derive asymptotically tight estimates for $\operatorname{spex}(n,γ)$, strengthening a classical bound due to Ellingham and Zha [J. Combin. Theory B, 2000]. We further characterize the extremal structures for the projective plane and torus, sharpening earlier bounds of Hong [J. Combin. Theory B, 1995]. For the planar case, we establish an explicit vertex threshold of $4.5\times 10^6$ for the Tait--Tobin theorem. Our approach combines extremal constructions of cellular embeddings, topological edge-switching techniques, and walk-counting estimates for large-scale substructures, revealing a bridge between spectral extremality and surface topology.

math.CO↗