The fractional version of Hedetniemi's conjecture is true

DOI10.1016/j.ejc.2011.03.004zbMath1229.05108OpenAlexW2004030389WikidataQ123205473 ScholiaQ123205473MaRDI QIDQ648973

Xuding Zhu

Publication date: 29 November 2011

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.03.004

zbMATH Keywords

Burr-Erdős-Lovász conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Related Items (28)

Degree Ramsey Numbers of Graphs ⋮ In praise of homomorphisms ⋮ Orthogonal graphs over finite commutative rings of odd characteristic ⋮ Thinness of product graphs ⋮ The fractional chromatic number of generalized cones over graphs ⋮ Shannon capacity and the categorical product ⋮ Sabidussi versus Hedetniemi for three variations of the chromatic number ⋮ Degree Ramsey numbers for even cycles ⋮ Maximum independent sets in direct products of cycles or trees with arbitrary graphs ⋮ Vector coloring the categorical product of graphs ⋮ Independent sets in direct products of vertex-transitive graphs ⋮ Turán numbers of several bipartite graphs ⋮ Altermatic number of categorical product of graphs ⋮ On 3-colorings of direct products of graphs ⋮ Relatively small counterexamples to Hedetniemi's conjecture ⋮ Hedetniemi's conjecture is asymptotically false ⋮ Fractional chromatic numbers of tensor products of three graphs ⋮ Independent sets in tensor products of three vertex-transitive graphs ⋮ Degree bipartite Ramsey numbers ⋮ Counterexamples to Hedetniemi's conjecture ⋮ A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function ⋮ Symplectic graphs over finite commutative rings ⋮ On the ultimate categorical independence ratio ⋮ Note on Hedetniemi's conjecture and the Poljak-Rödl function ⋮ A note on the Poljak-Rödl function ⋮ Counterexamples to Hedetniemi's conjecture with large fractional chromatic numbers ⋮ On maximum independent set of categorical product and ultimate categorical ratios of graphs ⋮ Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Independent sets in direct products of vertex-transitive graphs
• On topological relaxations of chromatic conjectures
• The chromatic number of the product of two 4-chromatic graphs is 4
• A survey on Hedetniemi's conjecture
• Graph products and the chromatic difference sequence of vertex-transitive graphs
• Chromatic Ramsey numbers
• Star-extremal graphs and the lexicographic product
• The fractional chromatic number of the categorical product of graphs
• Multiplicative graphs and semi-lattice endomorphisms in the category of graphs
• Fractional chromatic numbers of cones over graphs
• On directed local chromatic number, shift graphs, and Borsuk-like graphs
• The chromatic Ramsey number of odd wheels
• Star chromatic numbers and products of graphs
• The fractional chromatic number of the direct product of graphs
• Hedetniemi's conjecture---a survey
• Circular chromatic number: A survey

This page was built for publication: The fractional version of Hedetniemi's conjecture is true