Nathan Bowler, Johannes Carmesin, Christian Reiher
Published 2015-12-09Version 1
We show that, given an infinite cardinal $\mu$, a graph has colouring number at most $\mu$ if and only if it contains neither of two types of subgraph. We also show that every graph with infinite colouring number has a well-ordering of its vertices that simultaneously witnesses its colouring number and its cardinality.
Possible cardinalities of the center of a graph
A note on a sumset in $\mathbb{Z}_{2k}$
Cardinality of Rauzy classes
![QR code for arXiv:1512.02911 [math.CO]](http://oss.arxitics.com/images/favicon.svg)