The number of connected graphs with a given sparse degree sequence is identified up to exponential order by viewing them as giant components in a suitably chosen configuration model and applying a switching argument.
Addario-Berry and G
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The number and structure of connected graphs with a fixed degree sequence
The number of connected graphs with a given sparse degree sequence is identified up to exponential order by viewing them as giant components in a suitably chosen configuration model and applying a switching argument.