magyar

Tight bounds for embedding bounded degree trees

Csaba Béla and Nagy-György Judit and Levitt Ian and Szemerédi Endre: Tight bounds for embedding bounded degree trees.
In: Fete of Combinatorics and Computer Science. Bolyai Society Mathematical Studies (20). Springer Verlag - Bolyai Mathematical Society, Berlin; Budapest, pp. 95-137. (2010) ISBN 978-3-642-13579-8

[thumbnail of ll6.pdf] Text
ll6.pdf - Accepted Version
Restricted access: Logged in users only
Download (389kB) | Request a copy
[thumbnail of tree_embedding_v.pdf] Text
tree_embedding_v.pdf - Submitted Version
Restricted access: Logged in users only
Download (451kB) | Request a copy
Item Type: Book Section
Date: 2010
Number: 20
Page Range: pp. 95-137
ISSN: 1217-4696
ISBN: 978-3-642-13579-8
Publisher: Springer Verlag - Bolyai Mathematical Society
Place of Publication: Berlin; Budapest
Faculty/Unit: Faculty of Science and Informatics
Institution: Szegedi Tudományegyetem
Language: English
MTMT rekordazonosító: 1930874
DOI azonosító: https://doi.org/10.1007/978-3-642-13580-4_5
Related URLs:
Date Deposited: 2016. Dec. 19. 14:53
Last Modified: 2019. Apr. 03. 14:37
URI: http://publicatio.bibl.u-szeged.hu/id/eprint/8074
Web of Science® Times Cited: 10 View citing articles in Web of Science®

Actions (login required)

View Item View Item
Download Statistics

Downloads

Downloads per month over past year

Technical information: publicatio AT ek.szte.hu
SZTE Repository of Publications is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.