Paperlane

no. 16 · Tuesday 17 November 2026

The length of the longest path in random acyclic orientations of a complete multipartite graph

Aiden Corcoran, Erik Lundberg and Elisabeth Rodriguez

math.CO · 11 pp

Abstract

We study the distribution of the length of the longest path in a uniformly random acyclic orientation of a complete multipartite graph. We derive an explicit analytic expression for the probability generating function of the longest path length, and, for an arbitrary fixed number of parts of equal size, we apply analytic combinatorics in several variables to obtain asymptotics (as the part size tends toward infinity) for its mean longest path length.

comments
11 pages, 2 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.19164 ↗