LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Dujmović, Vida; Sidiropoulos, Anastasios; Wood, David R. (2015)
Languages: English
Types: Preprint
Subjects: Mathematics - Combinatorics, Computer Science - Computational Geometry, Computer Science - Discrete Mathematics

Classified by OpenAIRE into

ACM Ref: MathematicsofComputing_DISCRETEMATHEMATICS, TheoryofComputation_GENERAL
Bourgain and Yehudayoff recently constructed $O(1)$-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.
  • No references.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article

Collected from