Graphs and loopless digraphs with prescribed degrees: A proof of Mehrdad's conjecture
Year: 2026
Type: article
Abstract: Let d be a graphical degree sequence on n labelled vertices with Pvdv = 2M. Write G(d) for the number of simple graphs of degree sequence d and D(d) for the number of loopless digraphs whose in-degree and out-degree sequences are both d. We prove D(d) ≤ 3 nG(d) 2 Qvmax{1, dv}. It follows that G(d) ≥ (2 + M/n) −np D(d), establishing Mehrdad’scounting conjecture with constant 1. The proof counts transition systems that give a single Euler tour in each even component and bounds the preimages of the odd-component switch by counting within each final component.
Author: Runheng, Li
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236206796
