◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Sukhada Fadnavis

6 papers hereh-index 344 citations6 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author4
  • first author1
  • last author1

Across the 6 of 6 papers where every author was matched, so the position is known.

fields
  • math.CO5
  • math.ST1

identity via Semantic Scholar / OpenAlex

activity
20102015
most citedAsymptotic quantization of exponential random graphs

11 citations · 22 across the 6 of their papers we have counts for

collaborators
Showing 2015 · math.COShow all

2 papers · 2 filters

math.CO2015

On the roots of hypergraph chromatic polynomials

Sukhada Fadnavis

Let G=(V,E) be a finite, simple, connected graph with chromatic polynomial PG​(q). Sokal \cite{sokal} proved that the roots of the chromatic polynomial of G are bounded in…

math.CO2015★ 1 cited

A note on the shameful conjecture

Sukhada Fadnavis

Let PG​(q) denote the chromatic polynomial of a graph G on n vertices. The `shameful conjecture' due to Bartels and Welsh states that, $$\frac{P_G(n)}{P_G(n-1)} \geq \frac{n^…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.