11 citations · 12 across the 4 of their papers we have counts for
6 papers
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…
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^…
Asymptotic quantization of exponential random graphs
Mei Yin, Alessandro Rinaldo, Sukhada Fadnavis
We describe the asymptotic properties of the edge-triangle exponential random graph model as the natural parameters diverge along straight lines. We show that as we continuously va…
On Brenti's conjecture about the log-concavity of the chromatic polynomial
Sukhada Fadnavis
The chromatic polynomial is a well studied object in graph theory. There are many results and conjectures about the log-concavity of the chromatic polynomial and other polynomials…
A generalization of the Birthday problem and the chromatic polynomial
Sukhada Fadnavis
The birthday paradox states that there is at least a 50% chance that some two out of twenty-three randomly chosen people will share the same birth date. The calculation for this pr…
Warmth and mobility of random graphs
Sukhada Fadnavis, Matthew Kahle, Francisco Martinez-Figueroa
A graph homomorphism from the rooted -branching tree is said to be cold if the values of for vertices arbitrarily far away from the root can restrict the valu…