Perfect matchings in inhomogeneous random bipartite graphs in random environment

Jairo Bochi, Godofredo Iommi, Mario Ponce

Research output: Contribution to journalArticlepeer-review

Abstract

In this note we study inhomogeneous random bipartite graphs in random environment. These graphs can be thought of as an extension of the classical Erdős-Rényi random bipartite graphs in a random environment. We show that the expected number of perfect matchings obeys a precise asymptotic.

Original languageEnglish (US)
Pages (from-to)263-272
Number of pages10
JournalCubo
Volume24
Issue number2
DOIs
StatePublished - Aug 1 2022

All Science Journal Classification (ASJC) codes

  • Analysis
  • Algebra and Number Theory
  • Logic
  • Geometry and Topology

Fingerprint

Dive into the research topics of 'Perfect matchings in inhomogeneous random bipartite graphs in random environment'. Together they form a unique fingerprint.

Cite this