Adversarial resilience of matchings in bipartite random graphs

DOI10.4310/JOC.2017.V8.N1.A4zbMath1352.05148OpenAlexW2558944762MaRDI QIDQ501985

Andrew McDowell, Stefanie Gerke, Paul N. 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

bipartite graphmatchingrandom graphresilience

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 (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