Adversarial resilience of matchings in bipartite random graphs

DOI10.4310/JOC.2017.V8.N1.A4MaRDI QIDQ501985zbMATHOpenAlexFDO

Authors Stefanie Gerke, Andrew McDowell, Paul Balister

Publication date 10 January 2017

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4310/joc.2017.v8.n1.a4

zbMATH Keywords

matchingrandom graphbipartite graphresilience

Mathematics Subject Classification ID

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

Recommendations

• Controllability and matchings in random bipartite graphs
• Online Matching in Regular Bipartite Graphs with Randomized Adversary
• Small maximal matchings in random graphs.

Cited in

(1)

• Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs

This page was built for publication: Adversarial resilience of matchings in bipartite random graphs

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