Large bounded degree trees in expanding graphs.
Balogh, József; Csaba, Béla; Pei, Martin; Samotij, Wojciech
The Electronic Journal of Combinatorics [electronic only] (2010)
- Volume: 17, Issue: 1, page Research Paper R6, 9 p.-Research Paper R6, 9 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topBalogh, József, et al. "Large bounded degree trees in expanding graphs.." The Electronic Journal of Combinatorics [electronic only] 17.1 (2010): Research Paper R6, 9 p.-Research Paper R6, 9 p.. <http://eudml.org/doc/233109>.
@article{Balogh2010,
author = {Balogh, József, Csaba, Béla, Pei, Martin, Samotij, Wojciech},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {expansion properties; small trees; bounded maximum degree; sparse random graphs; spectral gap; spanning bounded degree trees},
language = {eng},
number = {1},
pages = {Research Paper R6, 9 p.-Research Paper R6, 9 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Large bounded degree trees in expanding graphs.},
url = {http://eudml.org/doc/233109},
volume = {17},
year = {2010},
}
TY - JOUR
AU - Balogh, József
AU - Csaba, Béla
AU - Pei, Martin
AU - Samotij, Wojciech
TI - Large bounded degree trees in expanding graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2010
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 17
IS - 1
SP - Research Paper R6, 9 p.
EP - Research Paper R6, 9 p.
LA - eng
KW - expansion properties; small trees; bounded maximum degree; sparse random graphs; spectral gap; spanning bounded degree trees
UR - http://eudml.org/doc/233109
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.