Abstract
The random graph is an infinite graph with the universal property that any embedding of extends to an embedding of , for any finite graph. In this paper we show that this graph embeds in the curve graph of a surface if and only if has infinite genus, showing that the curve system on an infinite genus surface is "as complicated as possible".
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.