Profile directory About Mobile apps
Log in Sign up
arXiv Math @arxiv_math@qoto.org
Follow

On Oriented Colourings of Graphs on Surfaces https://arxiv.org/abs/2409.13076 #mathCO

On Oriented Colourings of Graphs on Surfaces

For an oriented graph $G$, the least number of colours required to oriented colour $G$ is called the oriented chromatic number of $G$ and denoted $χ_o(G)$.For a non-negative integer $g$ let $χ_o(g)$ be the least integer such that $χ_o(G) \leq χ_o(g)$ for every oriented graph $G$ with Euler genus at most $g$. We will prove that $χ_o(g)$ is nearly linear in the sense that $Ω(\frac{g}{\log(g)}) \leq χ_o(g) \leq O(g \log(g))$. This resolves a question of the author, Bradshaw, and Xu, by improving their bounds of the form $Ω((\frac{g^2}{\log(g)})^{1/3}) \leq χ_o(g)$ and $χ_o(g) \leq O(g^{6400})$.

arxiv.org
September 24, 2024 at 3:10 AM · · feed2toot · 0 · 0 · 0
Sign in to participate in the conversation
Qoto Mastodon

QOTO: Question Others to Teach Ourselves
An inclusive, Academic Freedom, instance
All cultures welcome.
Hate speech and harassment strictly forbidden.

Trending now

#news0 people talking
0
#russia0 people talking
0
#france0 people talking
0

Resources

  • Terms of service
  • Privacy policy

Developers

  • Documentation
  • API

What is Mastodon?

qoto.org

  • About
  • v3.5.19-qoto

More…

  • Source code
  • Mobile apps
v3.5.19-qoto · Privacy policy