@inbook{6f8391e07fe141c9b416b599902623b1,

title = "Controllability and matchings in random bipartite graphs",

abstract = "Motivated by an application in controllability we consider maximum matchings in random bipartite graphs G = (A, B). First we analyse Karp–Sipser's algorithm to determine the asymptotic size of maximum matchings in random bipartite graphs with a fixed degree distribution. We then allow an adversary to delete one edge adjacent to every vertex in A in the more restricted model where each vertex in A chooses d neighbours uniformly at random from B.",

author = "Paul Balister and Stefanie Gerke",

year = "2015",

month = jul,

doi = "10.1017/CBO9781316106853.004",

language = "English",

volume = "424",

series = "London Mathematical Society Lecture Note Series",

publisher = "Cambridge University Press",

pages = "119--146",

editor = "Artur Czumaj and Agelos Georgakopoulos and Kr{\'a}l, {Daniel } and Lozin, {Vadim } and Pikhurko, {Oleg }",

booktitle = "Surveys in Combinatorics 2015",

}