## Abstract We prove the theorem from the title: the acyclic edge chromatic number of a random __d__βregular graph is asymptotically almost surely equal to __d__β+β1. This improves a result of Alon, Sudakov, and Zaks and presents further support for a conjecture that Ξ(G)β+β2 is the bound for the a
Finite fields and the 1-chromatic number of orientable surfaces
β Scribed by Vladimir P. Korzhik
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 98 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
The 1βchromatic number Ο~1~(S~p~) of the orientable surface S~p~ of genus p is the maximum chromatic number of all graphs which can be drawn on the surface so that each edge is crossed by no more than one other edge. We show that if there exists a finite field of order 4__m__+1, mβ₯3, then 8__m__+2β€Ο~1~(S)β€8__m__+3, where 8__m__+3 is Ringel's upper bound on Ο~1~(S). Β© 2009 Wiley Periodicals, Inc. J Graph Theory 63: 179β184, 2010
π SIMILAR VOLUMES
Using bounds of character sums we show that one of the open questions about the possible relation between the multiplicative orders of and # \ has a negative answer. In fact we show that in some sense the multiplicative orders of these elements are independent.
The number of points on the curve aY e =bX e +c (abc{0) defined over a finite field F q , q#1 (mod e), is known to be obtainable in terms of Jacobi sums and cyclotomic numbers of order e with respect to this field. In this paper, we obtain explicitly the Jacobi sums and cyclotomic numbers of order e