Impartial Digraphs

Author(s)
Zhao, Yufei; Zhou, Yunkun
Thumbnail
DownloadAccepted version (276.6Kb)
Open Access Policy
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
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.
Date issued
2020
URI
https://hdl.handle.net/1721.1/133364
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
Combinatorica
Publisher
Springer Science and Business Media LLC
Collections