Abstract
Consider the graph obtained by superposition of an independent pair of uniform infinite non-crossing perfect matchings of the set of integers. We prove that this graph contains at most one infinite path. Several motivations are discussed.
Contact and support
Need help, have a question, or want to contact the ResearchHub team?
© 2026 ResearchHub. Built for responsible scholarly connection.
Privacy-aware community infrastructureNicolas Curien, Gady Kozma, Vladas Sidoravicius, Laurent Tournier
Abstract
Authors
Institutions
No ROR-resolved institution is linked to this work yet.
Provenance
crossref
Confidence 100%
pubmed
Confidence 98%
unpaywall
Confidence 95%
datacite
Confidence 0%
No local reference links have been materialized yet.
No local citing links have been materialized yet.
No reference metadata is available yet.
No additional external references are available.