Permutation patterns and higher connectivity in inversion graphs

We prove that any permutation $π\in S_n$ whose inversion graph is $k$-connected has at least $\frac{k+1}{2}n - C$ inversions, where $C$ depends only on $k$. In particular, inversion graphs beat the general lower bound $\frac{kn}{2}$ for the number of edges in a $k$-connected graph. Furthermore, we characterize the permutation patterns $σ$ having the property that if $π$ avoids $σ$, then the bound improves to $kn - C$. The collection of patterns is $\mathrm{Av}(321, 2341, 4123)$, and it is independent of $k \geq 2$. This work is motivated by a result of Linusson and Verkama (2025) that can be reinterpreted as stating that any $1324$-avoiding permutation whose inversion graph satisfies a certain weaker notion of $2$-connectivity must have at least $2n - C$ inversions. Our final result gives a characterization of the patterns having this stronger property.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.17237
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Permutation patterns and higher connectivity in inversion graphs

Emil Verkama
arXiv (Cornell University)
Advanced Combinatorial Mathematics
preprint

Permutation patterns and higher connectivity in inversion graphs

Emil Verkama
preprint en

Abstract

We prove that any permutation $π\in S_n$ whose inversion graph is $k$-connected has at least $\frac{k+1}{2}n - C$ inversions, where $C$ depends only on $k$. In particular, inversion graphs beat the general lower bound $\frac{kn}{2}$ for the number of edges in a $k$-connected graph. Furthermore, we characterize the permutation patterns $σ$ having the property that if $π$ avoids $σ$, then the bound improves to $kn - C$. The collection of patterns is $\mathrm{Av}(321, 2341, 4123)$, and it is independent of $k \geq 2$. This work is motivated by a result of Linusson and Verkama (2025) that can be reinterpreted as stating that any $1324$-avoiding permutation whose inversion graph satisfies a certain weaker notion of $2$-connectivity must have at least $2n - C$ inversions. Our final result gives a characterization of the patterns having this stronger property.

arXiv (Cornell University)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon