Lesson plan
overfull graph
is larger than the product of its maximum degree and the number of vertices in the graph (its order) divided by 2 and rounded down. In this case, 22 > 20. In graph theory, an overfull graph is a graph whose size is greater than the product of its maximum degree and half of its order floored, i.e. |E| > \Delta (G) \lfloor |V|/2 \rfloor where |E| is the size of G, \displaystyle\Delta(G) is the maximum degree of G, and |V| is the order of G. The concept of an overfull subgraph, an overfull graph that is a subgraph, immediately follows. An alternate, stricter definition of an overfull subgraph S of a graph G requires \displaystyle\Delta (G) = \Delta (S) .
Article summary
is larger than the product of its maximum degree and the number of vertices in the graph (its order) divided by 2 and rounded down. In this case, 22 > 20. In graph theory, an overfull graph is a graph whose size is greater than the product of its maximum degree and half of its order floored, i.e. |E| > \Delta (G) \lfloor |V|/2 \rfloor where |E| is the size of G, \displaystyle\Delta(G) is the maximum degree of G, and |V| is the order of G. The concept of an overfull subgraph, an overfull graph that is a subgraph, immediately follows. An alternate, stricter definition of an overfull subgraph S of a graph G requires \displaystyle\Delta (G) = \Delta (S) .
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.