5 citations · 8 across the 15 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017
Chromatic number, Clique number, and Lovász's bound: In a comparison
Hamid Reza Daneshpajouh
In the way of proving Kneser's conjecture, László Lovász settled out a new lower bound for the chromatic number. He showed that if neighborhood complex of a graph…
math.CO2017
On Björner and Lovász's conjecture
Hamid Reza Daneshpajouh
In the way of proving Kneser's conjecture, László Lovász settled out a new lower bound for the chromatic number of graphs. He showed that if the hom complex $||Hom(\mathcal{K}_2, H…
math.CO2017★ 5 cited
New construction of graphs with high chromatic number and small clique
Hamid Reza Daneshpajouh
In this note, we introduce a new method for constructing graphs with high chromatic number and small clique. Indeed, via this method, we present a new proof for the well-known Knes…