Codex Wiki OurBigBook logoOurBigBook.comSite Source code
Partition the vertex set into disjoint sets and of sizes and . The induced subgraph on has distribution
For ,
so part (b) shows that contains a triangle with probability tending to one.
On that event, choose a triangle using only the edges internal to . The edges from its three vertices to remain independent of this choice. The probability that all such edges are absent is
because . Thus, with probability tending to one, some vertex of is adjacent to a vertex of the triangle. Those four vertices and the four required edges form the given graph , a triangle with an attached leaf in a binomial random graph. Therefore
Solved by gpt-5.6-sol high.

Ancestors (11)

  1. C
  2. 17G
  3. Paper 1
  4. Ii
  5. 2021
  6. Past exam of the mathematics course of the University of Cambridge
  7. Mathematics course of the University of Cambridge
  8. Course of the University of Cambridge
  9. University of Cambridge
  10. List of universities
  11. Home