Abstract
We present a new approach to the deletion method that is based on the Harris inequality. We obtain deletion lemmas that are similar in spirit to those of Rodl and Rucinski, but hold for arbitrary decreasing properties. That is, we show that under appropriate conditions, with very high (‘Janson-like’) probability it suffices to delete a small fraction of the edges of a random graph Gn,p to ensure that a given decreasing property holds. We also obtain stronger results for decreasing properties that only depend on edges involved in copies of some given graph H. As an application of our methods, we present a new deletion lemma that concerns local subgraph counts, i.e., the number of copies of H each edge or vertex of Gn,p is contained in.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
