An algorithmic Friedman-Pippenger theorem on tree embeddings and applications.
Dellamonica, Domingos jun.; Kohayakawa, Yoshiharu
The Electronic Journal of Combinatorics [electronic only] (2008)
- Volume: 15, Issue: 1, page Research Paper R127, 14 p.-Research Paper R127, 14 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topDellamonica, Domingos jun., and Kohayakawa, Yoshiharu. "An algorithmic Friedman-Pippenger theorem on tree embeddings and applications.." The Electronic Journal of Combinatorics [electronic only] 15.1 (2008): Research Paper R127, 14 p.-Research Paper R127, 14 p.. <http://eudml.org/doc/130279>.
@article{Dellamonica2008,
author = {Dellamonica, Domingos jun., Kohayakawa, Yoshiharu},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {expander; tree embedding problem; matching problem for bipartite graphs},
language = {eng},
number = {1},
pages = {Research Paper R127, 14 p.-Research Paper R127, 14 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {An algorithmic Friedman-Pippenger theorem on tree embeddings and applications.},
url = {http://eudml.org/doc/130279},
volume = {15},
year = {2008},
}
TY - JOUR
AU - Dellamonica, Domingos jun.
AU - Kohayakawa, Yoshiharu
TI - An algorithmic Friedman-Pippenger theorem on tree embeddings and applications.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2008
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 15
IS - 1
SP - Research Paper R127, 14 p.
EP - Research Paper R127, 14 p.
LA - eng
KW - expander; tree embedding problem; matching problem for bipartite graphs
UR - http://eudml.org/doc/130279
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.