Let count the copies of the complete graph in the binomial random graph . By linearity of the expected value and independence of distinct edges,
Throughout, is sufficiently large that . We have , and .
First, since ,
The first moment method proves .
For the existence of a -clique, put and . Since ,
This alone is insufficient: we must control the variance via the overlap formula for the variance of a clique count. Let indicate that a given -set spans a clique. If , the two copies share edges, so
For their edge sets are disjoint and the covariance vanishes, even when they share one vertex. Counting ordered pairs of -sets gives the exact formula
This includes the diagonal case .
To bound the overlap factor, regard it as the probability that a uniformly chosen -set intersects a fixed in exactly vertices. A union bound over the possible specified -subsets of yields
Here is a falling factorial, and the last bound holds for . Therefore
For , the concave quadratic is minimized at an endpoint. Its endpoint values are and , both at least . Thus every power of in the last sum is at most , and
because the logarithm of its numerator is . The second moment method, or Chebyshev's inequality directly, gives . Finally, every larger clique contains a -clique, so the absence of excludes all larger sizes. The clique number is exactly with high probability:

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact