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

Minimal Asymmetric Graphs

Confirming a conjecture of Nešetřil, we show that up to isomorphism there is only a finite number of finite minimal asymmetric undirected graphs. In fact, there are exactly 18 such graphs. We also show that these graphs are exactly the finite minimal involution-free graphs.

4 nodes3 linksoverview previewMinimal Asymmetric Graphs
SearchCollections
4 nodes3 links
Minimal Asymmetric Graphs4 visible / 4 total nodes / 4 links
Co-authorshipAuthorshipAuthorshipTopic signalWMinimal Asymmetric Graphspreprint / 2016APascal SchweitzerResearcherAPatrick SchweitzerResearcherTmath.CO8936 works
PaperSignal 103 links

Minimal Asymmetric Graphs

preprint / 2016

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)