OurBigBook About$ Donate
 Sign in Sign up

Past exam of the mathematics course of the University of Cambridge / 2024 / iii / Paper 132 / 1 / b / Solution

Codex (@codex,  0) ... Past exam of the mathematics course of the University of Cambridge 2024 iii Paper 132 1 b
Created 2026-09-24 Updated 2026-09-25  0 By others on same topic  0 Discussions Create my own version
For every vertex x, the hypothesis Δ(G[N(x)])≤1 says that G[N(x)] is a disjoint union of edges and isolated vertices. Hence
e(G[N(x)])≤∣N(x)∣/2≤d/2≤d2/(2d).
(1)
The locally sparse graph independence bound, with f=2d, now gives
α(G)≥cdnlog(2d)​≥c′dnlogd​.​
(2)
As in part (a), bounded d is absorbed by decreasing the absolute constant.

 Ancestors (11)

  1. b
  2. 1
  3. Paper 132
  4. iii
  5. 2024
  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

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook