[PDF][PDF] Asymptotic spectra: Theory, applications and extensions
A Wigderson, J Zuiddam - Manuscript, 2022 - math.ias.edu
In 1969, Strassen shocked the computational world with his subcubic algorithm for
multiplying matrices. Attempting to understand the best possible algorithm for this problem …
multiplying matrices. Attempting to understand the best possible algorithm for this problem …
Relatively small counterexamples to Hedetniemi's conjecture
X Zhu - Journal of Combinatorial Theory, Series B, 2021 - Elsevier
Hedetniemi conjectured in 1966 that χ (G× H)= min{χ (G), χ (H)} for all graphs G and H.
Here G× H is the graph with vertex set V (G)× V (H) defined by putting (x, y) and (x′, y′) …
Here G× H is the graph with vertex set V (G)× V (H) defined by putting (x, y) and (x′, y′) …
A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-R\" odl function
arXiv:1906.03748v2 [math.CO] 28 Oct 2019 Page 1 arXiv:1906.03748v2 [math.CO] 28 Oct 2019
A NOTE ON HEDETNIEMI’S CONJECTURE, STAHL’S CONJECTURE AND THE POLJAK-RODL …
A NOTE ON HEDETNIEMI’S CONJECTURE, STAHL’S CONJECTURE AND THE POLJAK-RODL …
On Hedetniemi's conjecture and the Poljak-Rodl function
X Zhu - arXiv preprint arXiv:1911.12015, 2019 - arxiv.org
Hedetniemi conjectured in 1966 that $\chi (G\times H)=\min\{\chi (G),\chi (H)\} $ for any
graphs G and H. Here $ G\times H $ is the graph with vertex set $ V (G)\times V (H) $ defined …
graphs G and H. Here $ G\times H $ is the graph with vertex set $ V (G)\times V (H) $ defined …
The chromatic number of the product of 14-chromatic graphs can be 13
C Tardif - Combinatorica, 2022 - Springer
We show that for any n≥ 13, there exist graphs with chromatic number larger than n whose
product has chromatic number n. Our construction is an adaptation of the construction of …
product has chromatic number n. Our construction is an adaptation of the construction of …
Shannon capacity and the categorical product
G Simonyi - arXiv preprint arXiv:1911.00944, 2019 - arxiv.org
Shannon OR-capacity $ C_ {\rm OR}(G) $ of a graph $ G $, that is the traditionally more often
used Shannon AND-capacity of the complementary graph, is a homomorphism monotone …
used Shannon AND-capacity of the complementary graph, is a homomorphism monotone …
Note on Hedetniemi's conjecture and the Poljak-Rödl function
X Zhu - 2019-20 MATRIX Annals, 2021 - Springer
Hedetniemi conjectured in 1966 that Hedetniemi conjectured in 1966 that χ (G * H)=\min {χ
(G), χ (H)\} χ (G× H)= min χ (G), χ (H) for any graphs G and H. Here G * HG× H is the graph …
(G), χ (H)\} χ (G× H)= min χ (G), χ (H) for any graphs G and H. Here G * HG× H is the graph …
In praise of homomorphisms
P Hell, J Nešetřil - Computer Science Review, 2021 - Elsevier
In praise of homomorphisms - ScienceDirect Skip to main contentSkip to article Elsevier logo
Journals & Books Search RegisterSign in View PDF Download full issue Search ScienceDirect …
Journals & Books Search RegisterSign in View PDF Download full issue Search ScienceDirect …
Hedetniemi's conjecture and strongly multiplicative graphs
A graph K is multiplicative if a homomorphism from any product G*H to K implies a
homomorphism from G or from H. Hedetniemi's conjecture stated that all cliques are …
homomorphism from G or from H. Hedetniemi's conjecture stated that all cliques are …
Brooks's theorem
M Stiebitz, B Toft - Topics in Chromatic Graph Theory, 2015 - Springer
Brooks' Theorem from 1941 is a cornerstone in graph theory. Until then graph coloring
theory was centered around planar graphs and the four color problem. Brooks' Theorem was …
theory was centered around planar graphs and the four color problem. Brooks' Theorem was …