On the chromatic number and independence number of hypergraph products

DOI10.1016/j.jctb.2006.03.005zbMath1108.05042OpenAlexW2150726531MaRDI QIDQ858686

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

Mathematics Subject Classification ID

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

Related Items (4)

The Cartesian product of hypergraphs ⋮ Colourful categories ⋮ A survey on hypergraph products ⋮ \([r,s,t\)-coloring of trees and bipartite graphs]

Cites Work

• Unnamed Item
• Unnamed Item
• On the arc-chromatic number of a digraph
• On a Ramsey-Turán type problem
• On a combinatorial problem. II
• 25 pretty graph colouring problems
• Ramsey-Turán theory

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