The number of Gallai k-colorings of complete graphs

28 Dec 2018 Bastos Josefran de Oliveira Benevides Fabricio S. Han Jie

An edge coloring of the $n$-vertex complete graph, $K_n$, is a Gallai coloring if it does not contain any rainbow triangle, that is, a triangle whose edges are colored with three distinct colors. We prove that for $n$ large and every $k$ with $k\le 2^{n/4300}$, the number of Gallai colorings of $K_n$ that use at most $k$ given colors is $(\binom{k}{2}+o_n(1))\,2^{\binom{n}{2}}$... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS