Abstract
AbstractFor d ≥ 1, a d‐clique in a graph G is a complete d‐vertex subgraph not contained in any larger complete subgraph of G. We investigate the limit distribution of the number of d‐cliques in the binomial random graph G(n, p), p = p(n), n→∞.
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.
