↓ Skip to main content

Fete of Combinatorics and Computer Science

Overview of attention for book
Attention for Chapter 5: Tight Bounds for Embedding Bounded Degree Trees
Altmetric Badge

Citations

dimensions_citation
5 Dimensions

Readers on

mendeley
2 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Tight Bounds for Embedding Bounded Degree Trees
Chapter number 5
Book title
Fete of Combinatorics and Computer Science
Published by
Springer, Berlin, Heidelberg, January 2010
DOI 10.1007/978-3-642-13580-4_5
Book ISBNs
978-3-64-213579-8, 978-3-64-213580-4
Authors

Béla Csaba, Judit Nagy-György, Ian Levitt, Endre Szemerédi

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Lecturer 1 50%
Professor > Associate Professor 1 50%
Readers by discipline Count As %
Mathematics 1 50%
Agricultural and Biological Sciences 1 50%