Layouts of Expander Graphs
Combinatorics
2016-02-09 v3 Computational Geometry
Discrete Mathematics
Abstract
Bourgain and Yehudayoff recently constructed -monotone bipartite expanders. By combining this result with a generalisation of the unraveling method of Kannan, we construct 3-monotone bipartite expanders, which is best possible. We then show that the same graphs admit 3-page book embeddings, 2-queue layouts, 4-track layouts, and have simple thickness 2. All these results are best possible.
Cite
@article{arxiv.1501.05020,
title = {Layouts of Expander Graphs},
author = {Vida Dujmović and Anastasios Sidiropoulos and David R. Wood},
journal= {arXiv preprint arXiv:1501.05020},
year = {2016}
}