Show simple item record

Perfect matchings in inhomogeneous random bipartite graphs in random environment

dc.creatorBochi, Jairo
dc.creatorIommi, Godofredo
dc.creatorPonce, Mario
dc.date2022-08-22
dc.date.accessioned2022-08-30T14:54:23Z
dc.date.available2022-08-30T14:54:23Z
dc.identifierhttps://revistas.ufro.cl/ojs/index.php/cubo/article/view/3101
dc.identifier10.56754/0719-0646.2402.0263
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/206743
dc.descriptionIn 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.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad de La Frontera. Temuco, Chile.en-US
dc.relationhttps://revistas.ufro.cl/ojs/index.php/cubo/article/view/3101/2201
dc.rightsCopyright (c) 2022 J. Bochi et al.en-US
dc.rightshttps://creativecommons.org/licenses/by-nc/4.0/en-US
dc.sourceCUBO, A Mathematical Journal; Vol. 24 No. 2 (2022); 263–272en-US
dc.sourceCUBO, A Mathematical Journal; Vol. 24 Núm. 2 (2022); 263–272es-ES
dc.source0719-0646
dc.source0716-7776
dc.subjectperfect matchingsen-US
dc.subjectlarge permanentsen-US
dc.subjectrandom graphsen-US
dc.titlePerfect matchings in inhomogeneous random bipartite graphs in random environmenten-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion


This item appears in the following Collection(s)

Show simple item record