An algorithmic Friedman-Pippenger theorem on tree embeddings and applications

zbMath1165.05318MaRDI QIDQ1010862

Domingos jun. Dellamonica, Yoshiharu Kohayakawa

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/130279

zbMATH Keywords

expandermatching problem for bipartite graphstree embedding problem

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Rolling backwards can move you forward: On embedding problems in sparse expanders ⋮ Sparse multipartite graphs as partition universal for graphs with bounded degree ⋮ Local resilience of almost spanning trees in random graphs ⋮ An improved upper bound on the density of universal random graphs

This page was built for publication: An algorithmic Friedman-Pippenger theorem on tree embeddings and applications