scientific article

zbMath0758.05053MaRDI QIDQ3990225

Svatopluk Poljak

Publication date: 28 June 1992

Full work available at URL: https://eudml.org/doc/118268

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

chromatic numbergraph productcoloring digraphsiterated antichainsLovász-Hedetniemi conjecture

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07) Coloring of graphs and hypergraphs (05C15)

Related Items (17)

Topology and Adjunction in Promise Constraint Satisfaction ⋮ Lattices arising in categorial investigations of Hedetniemi's conjecture ⋮ Coloring graph products---a survey ⋮ Hedetniemi's conjecture and dense Boolean lattices ⋮ Interleaved adjoints of directed graphs ⋮ The fractional version of Hedetniemi's conjecture is true ⋮ Relatively small counterexamples to Hedetniemi's conjecture ⋮ Hedetniemi's conjecture and adjoint functors in thin categories ⋮ Generic automorphisms and graph coloring ⋮ Iterated arc graphs ⋮ Note on Hedetniemi's conjecture and the Poljak-Rödl function ⋮ Hedetniemi's Conjecture and Strongly Multiplicative Graphs ⋮ A note on the Poljak-Rödl function ⋮ Digraphs Products ⋮ Chromatic numbers and products ⋮ Extractors for small zero-fixing sources ⋮ The categorical product of two 5-chromatic digraphs can be 3-chromatic

This page was built for publication: