The unavoidable rotation systems
Combinatorics
2019-10-29 v1
Abstract
For each positive integer , Pach, Solymosi, and T\'oth identified two canonical complete topological subgraphs and , and proved that every sufficiently large topological complete graph contains or as a subgraph. We generalize this result in the setting of abstract rotation systems.
Cite
@article{arxiv.1910.12834,
title = {The unavoidable rotation systems},
author = {Alan Arroyo and R. Bruce Richter and Gelasio Salazar and Matthew Sullivan},
journal= {arXiv preprint arXiv:1910.12834},
year = {2019}
}