Controllability and matchings in random bipartite graphs

DOI10.1017/CBO9781316106853.004zbMath1352.05161MaRDI QIDQ3179073

Stefanie Gerke, Paul N. Balister

Publication date: 20 December 2016

Published in: Surveys in Combinatorics 2015 (Search for Journal in Brave)

zbMATH Keywords

Karp-Sipser's algorithm

Mathematics Subject Classification ID

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

Related Items (5)

MAXIMUM MATCHINGS IN A PSEUDOFRACTAL SCALE-FREE WEB ⋮ Finding maximum matchings in random regular graphs in linear expected time ⋮ Towards an optimal contention resolution scheme for matchings ⋮ Maximum matchings in scale-free networks with identical degree distribution ⋮ The matching process and independent process in random regular graphs and hypergraphs

This page was built for publication: Controllability and matchings in random bipartite graphs