Embedding induced trees in sparse expanding graphs

Inspired by the network routing literature \cite{aggarwal1996efficient}, we develop what we call a ``Pre-Emptive Greedy Algorithm" to embed bounded degree induced trees in sparse expanders. This generalises a powerful and central result of Friedman and Pippenger to the induced setting. As corol...

Full description

Saved in:
Bibliographic Details
Main Authors Girão, António, Hurley, Eoin
Format Journal Article
LanguageEnglish
Published 06.06.2024
Subjects
Mathematics - Combinatorics
Online AccessGet full text

Cover

Be the first to leave a comment!
You must be logged in first