The number and structure of connected graphs with a fixed degree sequence

Documenti analoghi

• Tight universal bounds on the height times the width of random trees
  di: Donderwinkel, Serte, et al.
  Pubblicazione: (2024)
• Critical trees are neither too short nor too fat
  di: Addario-Berry, Louigi, et al.
  Pubblicazione: (2023)
• Random trees have height $O(\sqrt{n})$
  di: Addario-Berry, Louigi, et al.
  Pubblicazione: (2022)
• The largest common subtree of two random trees
  di: Angel, Omer, et al.
  Pubblicazione: (2025)
• Random intersection graphs with communities
  di: van der Hofstad, Remco, et al.
  Pubblicazione: (2018)