Skip to Main content Skip to Navigation
Conference papers

Density of universal classes of series-parallel graphs

Abstract : A class of graphs $\mathcal{C}$ ordered by the homomorphism relation is universal if every countable partial order can be embedded in $\mathcal{C}$. It was shown in [ZH] that the class $\mathcal{C_k}$ of $k$-colorable graphs, for any fixed $k≥3$, induces a universal partial order. In [HN1], a surprisingly small subclass of $\mathcal{C_3}$ which is a proper subclass of $K_4$-minor-free graphs $(\mathcal{G/K_4)}$ is shown to be universal. In another direction, a density result was given in [PZ], that for each rational number $a/b ∈[2,8/3]∪ \{3\}$, there is a $K_4$-minor-free graph with circular chromatic number equal to $a/b$. In this note we show for each rational number $a/b$ within this interval the class $\mathcal{K_{a/b}}$ of $0K_4$-minor-free graphs with circular chromatic number $a/b$ is universal if and only if $a/b ≠2$, $5/2$ or $3$. This shows yet another surprising richness of the $K_4$-minor-free class that it contains universal classes as dense as the rational numbers.
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Friday, August 14, 2015 - 11:37:35 AM
Last modification on : Wednesday, September 26, 2018 - 9:52:01 PM
Long-term archiving on: : Sunday, November 15, 2015 - 11:01:22 AM


Publisher files allowed on an open archive




Jaroslav Nešetřil, yared Nigussie. Density of universal classes of series-parallel graphs. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.245-250, ⟨10.46298/dmtcs.3407⟩. ⟨hal-01184364⟩



Record views


Files downloads