Abstract
In this paper we consider the following problem, given a graph H, what is the structure of a typical, i.e. random, H-free graph? We completely solve this problem for all graphs H containing a critical vertex. While this result subsumes a sequence of known results, its short proof is self contained.
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.
