Uniqueness of the infinite noodle
classification
🧮 math.PR
keywords
infinitegraphconsidercontainsdiscussedindependentintegersmatchings
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.