Oriented Colouring Graphs of Bounded Degree and Degeneracy
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916115985203200 |
|---|---|
| author | Clow, Alexander Stacho, Ladislav |
| author_facet | Clow, Alexander Stacho, Ladislav |
| contents | This paper considers upper bounds on the oriented chromatic number $χ_o(G)$, of an oriented graph $G$ in terms of its $2$-dipath chromatic number $χ_2(G)$, degeneracy $d(G)$, and maximum degree $Δ(G)$. In particular, we show that for all graphs $G$ with $χ_2(G) \leq k$ where $k \geq 2$ and $d(G) \leq t$ where $t \geq \log_2(k)$, $χ_o(G) = 33/10(k t^2 2^t)$. This improves an upper bound of MacGillivray, Raspaud, and Swartz of the form $χ_o(G) \leq 2^{χ_2(G)} -1$ to a polynomial upper bound for many classes of graphs, in particular, those with bounded degeneracy. Additionally, we asymptotically improve bounds for the oriented chromatic number in terms of maximum degree and degeneracy. For instance, we show that $χ_o(G) \leq (2\ln2 +o(1))Δ^2 2^Δ$ for all graphs, and $χ_o(G) \leq (2+o(1))Δd 2^d$ for graphs where degeneracy grows sublinearly in maximum degree. Here the asypmtotics are in $Δ$. The former improves the asymptotics of a results by Kostochka, Sopena, and Zhu \cite{kostochka1997acyclic}, while the latter improves the asymptotics of a result by Aravind and Subramanian \cite{aravind2009forbidden}. Both improvements are by a constant factor. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2304_09320 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Oriented Colouring Graphs of Bounded Degree and Degeneracy Clow, Alexander Stacho, Ladislav Combinatorics 05C15 (Primary) 05C20, 05C80 (Secondary) This paper considers upper bounds on the oriented chromatic number $χ_o(G)$, of an oriented graph $G$ in terms of its $2$-dipath chromatic number $χ_2(G)$, degeneracy $d(G)$, and maximum degree $Δ(G)$. In particular, we show that for all graphs $G$ with $χ_2(G) \leq k$ where $k \geq 2$ and $d(G) \leq t$ where $t \geq \log_2(k)$, $χ_o(G) = 33/10(k t^2 2^t)$. This improves an upper bound of MacGillivray, Raspaud, and Swartz of the form $χ_o(G) \leq 2^{χ_2(G)} -1$ to a polynomial upper bound for many classes of graphs, in particular, those with bounded degeneracy. Additionally, we asymptotically improve bounds for the oriented chromatic number in terms of maximum degree and degeneracy. For instance, we show that $χ_o(G) \leq (2\ln2 +o(1))Δ^2 2^Δ$ for all graphs, and $χ_o(G) \leq (2+o(1))Δd 2^d$ for graphs where degeneracy grows sublinearly in maximum degree. Here the asypmtotics are in $Δ$. The former improves the asymptotics of a results by Kostochka, Sopena, and Zhu \cite{kostochka1997acyclic}, while the latter improves the asymptotics of a result by Aravind and Subramanian \cite{aravind2009forbidden}. Both improvements are by a constant factor. |
| title | Oriented Colouring Graphs of Bounded Degree and Degeneracy |
| topic | Combinatorics 05C15 (Primary) 05C20, 05C80 (Secondary) |
| url | https://arxiv.org/abs/2304.09320 |