Maximum degree in minor-closed classes of graphs
Combinatorics
2013-04-19 v1
Abstract
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.
Cite
@article{arxiv.1304.5049,
title = {Maximum degree in minor-closed classes of graphs},
author = {Omer Gimenez and Dieter Mitsche and Marc Noy},
journal= {arXiv preprint arXiv:1304.5049},
year = {2013}
}
Comments
24 pages, 3 figures