Every finite graph of maximum degree at most has an independent set of size at least . Greedily choose a vertex and delete its closed neighbourhood.

Ancestors (6)

  1. Independent set
  2. Graph theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6. Home

Incoming links (1)

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