H. Daneshpajouh

activity

20092026

most citedNew construction of graphs with high chromatic number and small clique

5 citations · 8 across the 15 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018

Hedetniemi's conjecture from the topological viewpoint

Hamid Reza Daneshpajouh, Roman Karasev, Alexey Yu. Volovikov

This paper is devoted to studying a topological version of the famous Hedetniemi conjecture which says: The $Z /2$ -index of the Cartesian product of two $Z /2$ -spaces…

math.CO2018

On the chromatic number of generalized Kneser hypergraphs

Hamid Reza Daneshpajouh

The generalized Kneser hypergraph $K G^{r} (n, k, s)$ is the hypergraph whose vertices are all the $k$ -subsets of ${1, \dots, n}$ , and edges are $r$ -tuples of distinct vertices such…

math.CO2018

Dold's Theorem from Viewpoint of Strong Compatibility Graphs

Hamid Reza Daneshpajouh

Let $G$ be a non-trivial finite group. The well-known Dold's theorem states that: There is no continuous $G$ -equivariant map from an $n$ -connected simplicial $G$ -complex to a free…