Pages that link to "Item:Q2084794"

The following pages link to Counterexamples to Hedetniemi's conjecture with large fractional chromatic numbers (Q2084794):

Displaying 8 items.

• More counterexamples to the Alon-Saks-Seymour and rank-coloring conjectures (Q625392) (← links)
• On the chromatic number and independence number of hypergraph products (Q858686) (← links)
• The chromatic number of the product of 14-chromatic graphs can be 13 (Q2151188) (← links)
• Relatively small counterexamples to Hedetniemi's conjecture (Q2221923) (← links)
• Counterexamples to Hedetniemi's conjecture (Q2274002) (← links)
• The fractional chromatic number of the categorical product of graphs (Q2368592) (← links)
• Neighborhood complexes, homotopy test graphs and an application to coloring of product graphs (Q2673495) (← links)
• The chromatic number of the product of two graphs is at least half the minimum of the fractional chromatic numbers of the factors. (Q4828856) (← links)