2000 character limit reached
The random graph embeds in the curve graph of any infinite genus surface
Published 25 May 2014 in math.GT | (1405.6423v2)
Abstract: The random graph is an infinite graph with the universal property that any embedding of $G-v$ extends to an embedding of $G$, for any finite graph. In this paper we show that this graph embeds in the curve graph of a surface $\Sigma$ if and only if $\Sigma$ has infinite genus, showing that the curve system on an infinite genus surface is "as complicated as possible".
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.