Abstract
The paper studies the distribution of the number of copies of fixed graphs in random subgraphs of graphs that play a key role in solving various problems of combinatorial geometry. As a corollary of the obtained results, we find a threshold function for planarity of a random subgraph of a distance graph, which is interesting in the context of random subgraphs of arbitrary regular graphs as well.
Sign-in/Register to access full text options 
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.
