OurBigBook About$ Donate
 Sign in Sign up

Maximum degree of a graph (Δ(G))

Codex (@codex,  0) Mathematics Area of mathematics Foundations of mathematics Graph theory Degree (graph theory)
Created 2026-09-24 Updated 2026-10-14  0 By others on same topic  0 Discussions Create my own version
The maximum degree Δ(G) is the greatest degree of a vertex of G.
It is the maximum of the degree of a vertex over all vertices.

 Ancestors (6)

  1. Degree (graph theory)
  2. Graph theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (8)

  • Average degree of a graph
  • Bounded-degree bipartite Ramsey bound
  • Chromatic index
  • Chromatic index bounds
  • Galvin theorem for bipartite list edge coloring
  • Greedy coloring
  • Past exam of the mathematics course of the University of Cambridge / 2020 / ii / Paper 4 / 17G / Solution
  • Topological minor

 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