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

A topological menagerie

This is a recreational paper showing that certain linked graphs cannot be separated. The proofs employ elementary covering space theory, an appeal to a theorem of Scharlemann (concerning the band sums of two unknots), and a Jones polynomial calculation.

3 nodes2 linksoverview previewA topological menagerie
SearchCollections
3 nodes2 links
A topological menagerie3 visible / 3 total nodes / 2 links
AuthorshipTopic signalWA topological menageriepreprint / 2004APaul MelvinResearcherTmath.GT2393 works
PaperSignal 102 links

A topological menagerie

preprint / 2004

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)