The following pages link to Meysam Alishahi (Q490991):
Displaying 28 items.
- On the chromatic number of general Kneser hypergraphs (Q490992) (← links)
- Colorful subhypergraphs in uniform hypergraphs (Q510336) (← links)
- Rainbow paths with prescribed ends (Q540082) (← links)
- On the dynamic coloring of graphs (Q617650) (← links)
- Dynamic chromatic number of regular graphs (Q713302) (← links)
- Extremal \(G\)-free induced subgraphs of Kneser graphs (Q725003) (← links)
- Maximum nullity and zero forcing number on graphs with maximum degree at most three (Q777379) (← links)
- Circular coloring and Mycielski construction (Q968430) (← links)
- A generalization of the Erdős-Ko-Rado theorem (Q1045161) (← links)
- Chromatic number of random Kneser hypergraphs (Q1679319) (← links)
- Altermatic number of categorical product of graphs (Q1709531) (← links)
- On the random version of the Erdős matching conjecture (Q1720300) (← links)
- A new lower bound for the chromatic number of general Kneser hypergraphs (Q1750225) (← links)
- Chromatic number via Turán number (Q2012520) (← links)
- On chromatic number and minimum cut (Q2338633) (← links)
- Strengthening topological colorful results for graphs (Q2359976) (← links)
- Fair splitting of colored paths (Q2401427) (← links)
- A Note on Chromatic Sum (Q3447587) (← links)
- A generalization of Gale's lemma (Q4575536) (← links)
- Coloring properties of categorical product of general Kneser hypergraphs (Q4615057) (← links)
- Circular chromatic number of induced subgraphs of Kneser graphs (Q4615060) (← links)
- A REDUCTION IN THE SEARCH SPACE OF QC-LDPC CODES WITH GIRTH 8 (Q4956452) (← links)
- GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED (Q4956465) (← links)
- (Q5016033) (← links)
- (Q5016050) (← links)
- (Q5124707) (← links)
- Topological Bounds for Graph Representations over Any Field (Q5150813) (← links)
- On the Chromatic Number of Matching Kneser Graphs (Q5222567) (← links)
