On matchings in stochastic Kronecker graphs

zbMATH Open1351.05200MaRDI QIDQ727174FDOQ727174

Authors: Justyna Banaszak 

Publication date: 6 December 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p6

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Connectivity and giant component of stochastic Kronecker graphs
• Properties of stochastic Kronecker graphs
• Stochastic Kronecker Graphs
• Stochastic Kronecker graphs
• scientific article; zbMATH DE number 3777557

zbMATH Keywords

perfect matchingrandom graphsfactorsstochastic Kronecker graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Kronecker graphs: an approach to modeling networks
• Title not available (Why is that?)
• Good lower and upper bounds on binomial coefficients
• Giant components in Kronecker graphs
• Stochastic Kronecker graphs
• An in-depth analysis of stochastic Kronecker graphs
• Properties of stochastic Kronecker graphs
• Connectivity and giant component of stochastic Kronecker graphs

Cited In (4)

• Connectivity and giant component of stochastic Kronecker graphs
• A stochastic matching model on hypergraphs
• The planted matching problem: phase transitions and exact results
• Title not available (Why is that?)

Uses Software

• KronFit

This page was built for publication: On matchings in stochastic Kronecker graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727174)