نشر في Yufei Zhao
بتاريخ 2019
والبحث باللغة
English
تحميل البحث
الملخص بالإنكليزية
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.