This paper examines the structure of largest subgraphs Erd?s–Rényi random graph, G n , p with a given matching number. extends result Erd?s and Gallai who, in 1959, gave classification structures K We show that their to high probability when ? 8 ln or ? 1 but it does not extend (again probability) 4 ( 2 e ) < 3 .