Chromatic numbers, Sabidussi's Theorem and Hedetniemi's conjecture for non-commutative graphs

2019 ◽  
Vol 582 ◽  
pp. 291-309 ◽  
Author(s):  
Se-Jin Kim ◽  
Arthur Mehta
Keyword(s):  
Chromatic Numbers ◽  
Hedetniemi’S Conjecture ◽  
Hedetniemi's Conjecture

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

10.37236/8787 ◽  
2019 ◽  
Vol 26 (4) ◽  
Author(s):  
Claude Tardif ◽  
Xuding Zhu
Keyword(s):  
Kneser Graphs ◽  
Hedetniemi’S Conjecture ◽  
Hedetniemi's Conjecture

We prove that $\min\{\chi(G), \chi(H)\} - \chi(G\times H)$ can be arbitrarily large, and that if Stahl's conjecture on the multichromatic number of Kneser graphs holds, then $\min\{\chi(G), \chi(H)\}/\chi(G\times H) \leq 1/2 + \epsilon$ for large values of $\min\{\chi(G), \chi(H)\}$.

scholarly journals Hedetniemi's conjecture for Kneser hypergraphs

2016 ◽  
Vol 143 ◽  
pp. 42-55 ◽  
Author(s):  
Hossein Hajiabolhassan ◽  
Frédéric Meunier
Keyword(s):  
Hedetniemi’S Conjecture ◽  
Hedetniemi's Conjecture

An approach to hedetniemi's conjecture

1992 ◽  
Vol 16 (5) ◽  
pp. 423-436 ◽  
Author(s):  
N. W. Sauer ◽  
X. Zhu
Keyword(s):  
Hedetniemi’S Conjecture ◽  
Hedetniemi's Conjecture
Sign in / Sign up

Export Citation Format

Share Document