University of Calgary

Chromatic numbers and products

Abstract

Let $f(n)$ be the smallest number so that there are two $n$ chromatic graphs whose product has chromatic number $f(n)$. Under the assumption that a certain sharper result than one obtained by Duffus, Sands and Woodrow \cite{DSW}, and Welzl \cite{W}, holds we will prove that $f(n)\geq {n/2}$.
Powered by UNITIS. More features.

Get Course Information