| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657108 | Journal of Combinatorial Theory, Series B | 2010 | 5 Pages |
Abstract
A class of simple undirected graphs is small if it contains at most n!αn labeled graphs with n vertices, for some constant α. We prove that for any constants c,ε>0, the class of graphs with expansion bounded by the function f(r)=cr1/3−ε is small. Also, we show that the class of graphs with expansion bounded by is not small.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
