35 citations · 70 across the 19 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017
Coloring Properties of Categorical Product of General Kneser Hypergraphs
Roya Abyazi Sani, Meysam Alishahi, Ali Taherkhani
More than 50 years ago Hedetniemi conjectured that the chromatic number of categorical product of two graphs is equal to the minimum of their chromatic numbers. This conjecture has…
math.CO2017★ 6 cited
A new lower bound for the chromatic number of general Kneser hypergraphs
Roya Abyazi Sani, Meysam Alishahi
A general Kneser hypergraph is an -uniform hypergraph that somehow encodes the edge intersections of a ground hypergraph . The colorabilit…
math.CO2017
Fair splitting of colored paths
Meysam Alishahi, Frédéric Meunier
This paper deals with two problems about splitting fairly a path with colored vertices, where "fairly" means that each part contains almost the same amount of vertices in each colo…