M. Alishahi

activity

20082026

most citedOn Chromatic Number of Kneser Hypergraphs

35 citations · 70 across the 19 of their papers we have counts for

collaborators

Showing 2018 · math.COShow all

2 papers · 2 filters

math.CO2018

On the random version of the Erdős matching conjecture

Meysam Alishahi, Ali Taherkhani

The Kneser hypergraph $KG_{n, k}^{r}$ is an $r$ -uniform hypergraph with vertex set consisting of all $k$ -subsets of ${1, \dots, n}$ and any collection of $r$ vertices forms an…

math.CO2018

Extremal $G$ -free induced subgraphs of Kneser graphs

Meysam Alishahi, Ali Taherkhani

The Kneser graph $KG_{n, k}$ is a graph whose vertex set is the family of all $k$ -subsets of $[n]$ and two vertices are adjacent if their corresponding subsets are disjoint. T…

On the random version of the Erdős matching conjecture

Extremal G-free induced subgraphs of Kneser graphs

Extremal $G$ -free induced subgraphs of Kneser graphs