35 citations · 70 across the 19 of their papers we have counts for
24 papers · 1 filter
The Matching Ramsey Number of Hypergraphs, Revisited
Saeed Shaebani, Meysam Alishahi
Suppose that a hypergraph and an arbitrary nonempty (finite or infinite) set of available colors are given. Each color is associated with a frequency , whe…
Topological bounds for graph representations over any field
Meysam Alishahi, Frédéric Meunier
Haviv ({\em European Journal of Combinatorics}, 2019) has recently proved that some topological lower bounds on the chromatic number of graphs are also lower bounds on their orthog…
Maximum Nullity and Forcing Number on Graphs with Maximum Degree at most Three
Meysam Alishahi, Elahe Rezaei-Sani, Elahe Sharifi
A dynamic coloring of the vertices of a graph starts with an initial subset of colored vertices, with all remaining vertices being non-colored. At each time step, a colored…
On the random version of the Erdős matching conjecture
Meysam Alishahi, Ali Taherkhani
The Kneser hypergraph is an -uniform hypergraph with vertex set consisting of all -subsets of and any collection of vertices forms an…
Extremal -free induced subgraphs of Kneser graphs
Meysam Alishahi, Ali Taherkhani
The Kneser graph is a graph whose vertex set is the family of all -subsets of and two vertices are adjacent if their corresponding subsets are disjoint. T…
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…