We construct minor-closed addable families of graphs that are subcritical and contain all planar graphs. This contradicts (one direction of) a well-known conjecture of Noy.

Classical ergodic theory for integer-group actions uses entropy as a complete invariant for isomorphism of IID (independent, identically distributed) processes (a.k.a. product measures). This theory holds for amenable groups as well. Despite recent spectacular progress of Bowen, the situation for non-amenable groups, including free groups, is still largely mysterious. We present some illustrative results and open questions on free groups, which are particularly interesting in combinatorics, statistical physics and probability. Our results include bounds on minimum and maximum bisection for random cubic graphs that improve on all past bounds.

A complete classification is given of pentavalent symmetric graphs of order $30p$, where $p\ge 5$ is a prime. It is proved that such a graph ${\Gamma }$ exists if and only if $p=13$ and, up to isomorphism, there is only one such graph. Furthermore, ${\Gamma }$ is isomorphic to $\mathcal{C}_{390}$, a coset graph of PSL(2, 25) with ${\sf Aut}\, {\Gamma }=\mbox{PSL(2, 25)}$, and ${\Gamma }$ is 2-regular. The classification involves a new 2-regular pentavalent graph construction with square-free order.

For c ∈ (0,1) let n(c) denote the set of n-vertex perfect graphs with density c and let n(c) denote the set of n-vertex graphs without induced C5 and with density c.

We show that with otherwise, where H is the binary entropy function.

Further, we use this result to deduce that almost all graphs in n(c) have homogeneous sets of linear size. This answers a question raised by Loebl and co-workers.