arXiv:1807.00585 [math.CO]AbstractReferencesReviewsResources
Lattice Path Matroids are 3-Colorable
Immanuel Albrecht, Winfried Hochstättler
Published 2018-07-02Version 1
We show that every lattice path matroid of rank at least two has a quite simple coline, also known as a positive coline. Therefore every orientation of a lattice path matroid is 3-colorable with respect to the chromatic number of oriented matroids introduced by J. Ne\v{s}et\v{r}il, R. Nickel, and W. Hochst\"attler.
Categories: math.CO
Related articles: Most relevant | Search more
Topological lower bounds for the chromatic number: A hierarchy
arXiv:0706.0223 [math.CO] (Published 2007-06-01)
Two Erdos problems on lacunary sequences: Chromatic number and Diophantine approximation
arXiv:1408.2002 [math.CO] (Published 2014-08-09)
On the Chromatic Number of $\mathbb{R}^n$ for Small Values of $n$