35 citations · 70 across the 19 of their papers we have counts for
5 papers · 2 filters
Circular chromatic number of induced subgraphs of Kneser graphs
Meysam Alishahi, Ali Taherkhani
Investigating the equality of the chromatic number and the circular chromatic number of graphs has been an active stream of research for last decades. In this regard, Habolhassan a…
Chromatic Number of Random Kneser Hypergraphs
Meysam Alishahi, Hossein Hajiabolhassan
Recently, Kupavskii~[{\it On random subgraphs of {K}neser and {S}chrijver graphs. J. Combin. Theory Ser. A, {\rm 2016}.}] investigated the chromatic number of random Kneser graphs…
A Generalization of Gale's lemma
Meysam Alishahi, Hossein Hajiabolhassan
In this work, we present a generalization of Gale's lemma. Using this generalization, we introduce two combinatorial sharp lower bounds for and ${\rm…
Strengthening topological colorful results for graphs
Meysam Alishahi, Hossein Hajiabolhassan, Frédéric Meunier
Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number…
Colorful Subhypergraphs in Uniform Hypergraphs
Meysam Alishahi
There are several topological results ensuring the existence of a large complete bipartite subgraph in any properly colored graph satisfying some special topological regularity con…