Controllability and matchings in random bipartite graphs

DOI10.1017/CBO9781316106853.004zbMATH Open1352.05161MaRDI QIDQ3179073FDOQ3179073

Stefanie Gerke, Paul Balister

Publication date: 20 December 2016

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

Recommendations

• Controllability, matching ratio and graph convergence
• On a Conjecture of Godsil Concerning Controllable Random Graphs
• Matchings in random biregular bipartite graphs
• Further results on almost controllable graphs
• Controllability of undirected graphs
• Further results on controllable graphs
• Optimality of Fast-Matching Algorithms for Random Networks With Applications to Structural Controllability
• Greedy matching in bipartite random graphs
• The controllability of graphs with diameter \(0-2\)
• Controllability of NEPSes of graphs

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)

Cited In (7)

• MAXIMUM MATCHINGS IN A PSEUDOFRACTAL SCALE-FREE WEB
• Finding maximum matchings in random regular graphs in linear expected time
• On a Conjecture of Godsil Concerning Controllable Random Graphs
• Zero forcing number, constrained matchings and strong structural controllability
• Towards an optimal contention resolution scheme for matchings
• The matching process and independent process in random regular graphs and hypergraphs
• Maximum matchings in scale-free networks with identical degree distribution

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

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