On the <i>f</i> -vectors of flow polytopes for the complete graph

Abstract The Chan–Robbins–Yuen polytope ( $CRY_n$ ) of order n is a face of the Birkhoff polytope of doubly stochastic matrices that is also a flow polytope of the directed complete graph $K_{n+1}$ with netflow $(1,0,0, \ldots , 0, -1)$ . The volume and lattice points of this polytope have been actively studied; however, its face structure has received less attention. We give generating functions and explicit formulas for computing the f -vector by using Hille’s (2003) result bijecting faces of a flow polytope to certain graphs, as well as Andresen–Kjeldsen’s (1976) result that enumerates certain subgraphs of the directed complete graph. We extend our results to flow polytopes of the complete graph having arbitrary (non-negative) netflow vectors and recover the f -vector of the Tesler polytope of Mészáros–Morales–Rhoades (2017).

Authors

Institutions

Publication Details

Journal
Canadian Journal of Mathematics
Published
2025-09-01
DOI
https://doi.org/10.4153/s0008414x2510151x
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On the f -vectors of flow polytopes for the complete graph

William T. Dugan
Canadian Journal of Mathematics
Advanced Graph Theory Research
article

On the f -vectors of flow polytopes for the complete graph

William T. Dugan
article en

Abstract

Abstract The Chan–Robbins–Yuen polytope ( $CRY_n$ ) of order n is a face of the Birkhoff polytope of doubly stochastic matrices that is also a flow polytope of the directed complete graph $K_{n+1}$ with netflow $(1,0,0, \ldots , 0, -1)$ . The volume and lattice points of this polytope have been actively studied; however, its face structure has received less attention. We give generating functions and explicit formulas for computing the f -vector by using Hille’s (2003) result bijecting faces of a flow polytope to certain graphs, as well as Andresen–Kjeldsen’s (1976) result that enumerates certain subgraphs of the directed complete graph. We extend our results to flow polytopes of the complete graph having arbitrary (non-negative) netflow vectors and recover the f -vector of the Tesler polytope of Mészáros–Morales–Rhoades (2017).

Canadian Journal of Mathematics
University of Massachusetts Amherst (US)
National Science Foundation, Université du Québec à Montréal
Openalex Percentile: Top 76%
Advanced Graph Theory Research
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.