BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Graph explorer

Impartial digraphs

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.

4 nodes3 linksoverview previewImpartial digraphs
SearchCollections
4 nodes3 links
Impartial digraphs4 visible / 4 total nodes / 4 links
Co-authorshipAuthorshipAuthorshipTopic signalWImpartial digraphspreprint / 2020AYufei ZhaoResearcherAYunkun ZhouResearcherTmath.CO8936 works
PaperSignal 103 links

Impartial digraphs

preprint / 2020

Open

Personal maps

Sign in to save graph views

Saved views keep the query, focus and filters attached to this map.

Sign in

Public snapshots

1 shared view(s)