Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Maximum degree in minor-closed classes of graphs

Autor
Giménez, O.; Mitsche, D.; Noy, M.
Tipus d'activitat
Article en revista
Revista
European journal of combinatorics
Data de publicació
2016-07-01
Volum
55
Pàgina inicial
41
Pàgina final
61
DOI
https://doi.org/10.1016/j.ejc.2016.02.001 Obrir en finestra nova
Resum
Given a class of graphs g closed under taking minors, we study the maximum degree Delta(n) of random graphs from g, with n vertices. We prove several lower and upper bounds that hold with high probability. Among other results, we find classes of graphs providing orders of magnitude for Delta(n) not observed before, such us log n/ log log log n and log n/ log log log log n. (C) 2016 Elsevier Ltd. All rights reserved.
Paraules clau
Random Tree
Grup de recerca
MD - Matemàtica Discreta

Participants