A note on circular chromatic number of graphs with large girth and similar problems

In this short note, we extend the result of Galluccio, Goddyn, and Hell, which states that graphs of large girth excluding a minor are nearly bipartite. We also prove a similar result for the oriented chromatic number, from which follows in particular that graphs of large girth excluding a minor have oriented chromatic number at most $5$, and for the $p$th chromatic number $\chi_p$, from which follows in particular that graphs $G$ of large girth excluding a minor have $\chi_p(G)\leq p+2$

Cycles with consecutive odd lengths

It is proved that there exists an absolute constant c > 0 such that for every natural number k, every non-bipartite 2-connected graph with average degree at least ck contains k cycles with consecutive odd lengths. This implies the existence of the absolute constant d > 0 that every non-bipartite 2-connected graph with minimum degree at least dk contains cycles of all lengths modulo k, thus providing an answer (in a strong form) to a question of Thomassen. Both results are sharp up to the constant factors.Comment: 7 page

Fractional coloring of triangle-free planar graphs

We prove that every planar triangle-free graph on $n$ vertices has fractional chromatic number at most $3-\frac{1}{n+1/3}$

Cycle lengths in sparse graphs

Let C(G) denote the set of lengths of cycles in a graph G. In the first part of this paper, we study the minimum possible value of |C(G)| over all graphs G of average degree d and girth g. Erdos conjectured that |C(G)| =\Omega(d^{\lfloor (g-1)/2\rfloor}) for all such graphs, and we prove this conjecture. In particular, the longest cycle in a graph of average degree d and girth g has length \Omega(d^{\lfloor (g-1)/2\rfloor}). The study of this problem was initiated by Ore in 1967 and our result improves all previously known lower bounds on the length of the longest cycle. Moreover, our bound cannot be improved in general, since known constructions of d-regular Moore Graphs of girth g have roughly that many vertices. We also show that \Omega(d^{\lfloor (g-1)/2\rfloor}) is a lower bound for the number of odd cycle lengths in a graph of chromatic number d and girth g. Further results are obtained for the number of cycle lengths in H-free graphs of average degree d. In the second part of the paper, motivated by the conjecture of Erdos and Gyarfas that every graph of minimum degree at least three contains a cycle of length a power of two, we prove a general theorem which gives an upper bound on the average degree of an n-vertex graph with no cycle of even length in a prescribed infinite sequence of integers. For many sequences, including the powers of two, our theorem gives the upper bound e^{O(\log^* n)} on the average degree of graph of order n with no cycle of length in the sequence, where \log^* n is the number of times the binary logarithm must be applied to n to get a number which is at mos