Impartial digraphs
Combinatorics
2020-06-15 v2
Abstract
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.
Cite
@article{arxiv.1906.10482,
title = {Impartial digraphs},
author = {Yufei Zhao and Yunkun Zhou},
journal= {arXiv preprint arXiv:1906.10482},
year = {2020}
}
Comments
15 pages