Abstract
We represent the universal Menger curve as the topological realization [Formula: see text] of the projective Fraïssé limit [Formula: see text] of the class of all finite connected graphs. We show that [Formula: see text] satisfies combinatorial analogues of the Mayer–Oversteegen–Tymchatyn homogeneity theorem and the Anderson–Wilson projective universality theorem. Our arguments involve only 0-dimensional topology and constructions on finite graphs. Using the topological realization [Formula: see text], we transfer some of these properties to the Menger curve: we prove the approximate projective homogeneity theorem, recover Anderson’s finite homogeneity theorem, and prove a variant of Anderson–Wilson’s theorem. The finite homogeneity theorem is the first instance of an “injective” homogeneity theorem being proved using the projective Fraïssé method. We indicate how our approach to the Menger curve may extend to higher dimensions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.