2 research outputs found
Large induced matchings in random graphs
Given a large graph , does the binomial random graph contain a
copy of as an induced subgraph with high probability? This classical
question has been studied extensively for various graphs , going back to the
study of the independence number of by Erd\H{o}s and Bollob\'as, and
Matula in 1976. In this paper we prove an asymptotically best possible result
for induced matchings by showing that if for some large
constant , then contains an induced matching of order approximately
, where