Aravind–Subramanian conjecture for the oriented chromatic number of bounded-genus graphs
Aravind–Subramanian conjecture for the oriented chromatic number of bounded-genus graphs
Let be a graph of Euler genus , and let denote its oriented chromatic number.
Aravind–Subramanian conjecture. There is an absolute constant implicit in the -notation such that
This removes the arbitrarily small positive term from the known bound for every constant .
Sources & referencesView supporting material
Primary source
Peter Bradshaw, Alexander Clow and Jingwei Xu, “Injective edge colorings of degenerate graphs and the oriented chromatic number”, arXiv:2308.15654 (2023).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.