| dc.contributor.author | Zhao, Yufei | |
| dc.contributor.author | Zhou, Yunkun | |
| dc.date.accessioned | 2021-10-27T19:52:22Z | |
| dc.date.available | 2021-10-27T19:52:22Z | |
| dc.date.issued | 2020 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/133364 | |
| dc.description.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. | |
| dc.language.iso | en | |
| dc.publisher | Springer Science and Business Media LLC | |
| dc.relation.isversionof | 10.1007/s00493-020-4280-0 | |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | |
| dc.source | arXiv | |
| dc.title | Impartial Digraphs | |
| dc.type | Article | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | |
| dc.relation.journal | Combinatorica | |
| dc.eprint.version | Author's final manuscript | |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | |
| dc.date.updated | 2021-06-01T17:58:19Z | |
| dspace.orderedauthors | Zhao, Y; Zhou, Y | |
| dspace.date.submission | 2021-06-01T17:58:20Z | |
| mit.journal.volume | 40 | |
| mit.journal.issue | 6 | |
| mit.license | OPEN_ACCESS_POLICY | |
| mit.metadata.status | Authority Work and Publication Information Needed | |
