On the chromatic number and independence number of hypergraph products

DOI10.1016/J.JCTB.2006.03.005zbMATH Open1108.05042OpenAlexW2150726531MaRDI QIDQ858686FDOQ858686

Vojtěch Rödl, Dhruv Mubayi

Publication date: 11 January 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2006.03.005

Recommendations

• scientific article
• scientific article; zbMATH DE number 1239597
• The chromatic number of the product of two \(\aleph _ 1\)-chromatic graphs can be countable
• On the chromatic number of the product of graphs
• Counterexamples to Hedetniemi's conjecture with large fractional chromatic numbers

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cites Work

• Ramsey-Turán theory
• 25 pretty graph colouring problems
• Title not available (Why is that?)
• On a Ramsey-Turán type problem
• On a combinatorial problem. II
• On the arc-chromatic number of a digraph
• Title not available (Why is that?)

Cited In (9)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Colourful categories
• The Cartesian product of hypergraphs
• On the chromatic number of the product of graphs
• Title not available (Why is that?)
• \([r,s,t]\)-coloring of trees and bipartite graphs
• Associative graph products and their independence, domination and coloring numbers
• A survey on hypergraph products

This page was built for publication: On the chromatic number and independence number of hypergraph products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858686)