Soheil Azarpendar

collaborators

2 papers

math.CO2020

Lower bounds for the chromatic number of certain Kneser-type hypergraphs

Soheil Azarpendar, Amir Jafari

Let $n \geq 1$ , $r \geq 2$ , and $s \geq 0$ be integers and $P = {P_{1}, \dots, P_{l}}$ be a partition of $[n] = {1, \dots, n}$ with $∣ P_{i} ∣ \leq r$ for $i = 1, \dots, l$ . Also, let $F$ b…

math.CO2020

On some topological and combinatorial lower bounds on chromatic number of Kneser type hyper graphs

Soheil Azarpendar, Amir Jafari

In this paper, we prove a generalization of a conjecture of Erdös, about the chromatic number of certain Kneser-type hypergraphs. For integers $n, k, r, s$ with $n \geq r k$ and $2\le s\…