A Note on Hedetniemi's Conjecture, Stahl's Conjecture and the Poljak-Rödl Function.

arxiv（2019）

引用 3|浏览3

暂无评分

摘要

We prove that min{(G), x(H)} -(G x H) can be arbitrarily large, and that if Stahl's conjecture on the multichromatic number of Kneser graphs holds, then we can have x (G x H) /min{x(G), x(H)} <= 1/2+epsilon for large values of minfx(G), x(H)}.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要