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.

Highlights

  • We assume graphs are finite and simple

  • We write G ≤ G if there is a homomorphism from G to G

  • Somewhat surprisingly we show that Theorem 1, 2, and 3 cover all cases when Ka/b is a finite set

Read more

Summary

Introduction

A homomorphism from G to G is a mapping f :V (G) → V (G ) which preserves adjacency. We write G ≤ G if there is a homomorphism from G to G. The smallest graph H for which G ∼ H is called the core of G. The core is uniquely determined up to an isomorphism. It can be seen that H is an induced subgraph of G. Let C and C be two classes of graphs. See [2] for introduction to graphs and their homomorphisms.

Jaroslav Nesetril and Yared Nigussie
By induction
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call