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

Hadwiger meets Cayley

We show that every connected $k$-chromatic graph contains at least $k^{k-2}$ spanning trees.

6 nodes5 linksoverview previewHadwiger meets Cayley
SearchCollections
6 nodes5 links
Hadwiger meets Cayley6 visible / 6 total nodes / 11 links
Co-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipAuthorshipAuthorshipAuthorshipAuthorshipTopic signalWHadwiger meets Cayleypreprint / 2020AJacob W. CooperResearcherAAdam KabelaResearcherADaniel Král'ResearcherAThéo PierronResearcherTmath.CO8936 works
PaperSignal 105 links

Hadwiger meets Cayley

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)