Impartial Digraphs
Name
1906.10482.pdf
Description
Accepted version
Size
276.67 KB
Format
Adobe PDF
Checksum (MD5)
f9108a73c3c0850f9f803ba7a3aa3464
Author(s)
Zhao, Yufei
Zhou, Yunkun
Date Issued
2020
Journal
Combinatorica
Publisher
Springer Science and Business Media LLC
Version
Author's final manuscript
Abstract
© 2020, János Bolyai Mathematical Society and Springer-Verlag. We prove a conjecture of Fox, Huang, and Lee that characterizes directed graphs that have constant density in all tournaments: they are disjoint unions of trees that are each constructed in a certain recursive way.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00493-020-4280-0
