11 citations · 22 across the 6 of their papers we have counts for
Showing 2015 · math.COShow all
2 papers · 2 filters
math.CO2015
On the roots of hypergraph chromatic polynomials
Sukhada Fadnavis
Let be a finite, simple, connected graph with chromatic polynomial . Sokal \cite{sokal} proved that the roots of the chromatic polynomial of are bounded in…
math.CO2015★ 1 cited
A note on the shameful conjecture
Sukhada Fadnavis
Let denote the chromatic polynomial of a graph on vertices. The `shameful conjecture' due to Bartels and Welsh states that, $$\frac{P_G(n)}{P_G(n-1)} \geq \frac{n^…