5 problems

Let $\mathcal A$ be a class of graphs that is bridge-addable, meaning that adding an edge between vertices in distinct components preserves membership, and decomposable, meaning th…

Let $\mathcal A$ be a class of graphs that is bridge-addable, meaning that adding an edge between vertices in distinct components preserves membership, and decomposable, meaning th…

Let $\mathcal A$ be a class of graphs that is bridge-addable, meaning that adding an edge between vertices in distinct components preserves membership, and decomposable, meaning th…

Let $\mathcal A$ be a class of graphs, let $\tilde{\mathcal A}_n$ be the set of unlabelled graphs in $\mathcal A$ on $n$ vertices, and let $\tilde{R}_n \in_u \tilde{\mathcal A}$ de…

Let $\mathcal{G}$ be an addable, minor-closed class and let $\mathcal{U}\mathcal{G}$ be its corresponding collection of unlabelled graphs. Let $C_n \in_u \mathcal{U}\mathcal{C}_n$…