Math 2.0

Combinatorics Definition

Forest

Builds on Acyclic graphTree

Definition

A forest is an acyclic graph.

Remarks

The connected components of a forest are trees. Thus a forest is a disjoint union of trees. Every tree is a forest. The graph with no edges on nn vertices is a forest with nn components.

Reading path

To understand this page from the ground up, read these 10 pages in order. The foundations come first.

Show the path as a graph
Graph, definition, no evidence levelGraphdefinitionWalk, definition, no evidence levelWalkdefinitionReachability, definition, no evidence levelReachabilitydefinitionTrail, definition, no evidence levelTraildefinitionConnected graph, definition, no evidence levelConnected graphdefinitionCircuit, definition, no evidence levelCircuitdefinitionCycle, definition, no evidence levelCycledefinitionAcyclic graph, definition, no evidence levelAcyclic graphdefinitionTree, definition, no evidence levelTreedefinitionForest, definition, no evidence levelForestdefinition
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Graph definition
  2. Walk definition
  3. Reachability definition
  4. Trail definition
  5. Connected graph definition
  6. Circuit definition
  7. Cycle definition
  8. Acyclic graph definition
  9. Tree definition
  10. Forest definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Tree_(graph_theory), Forest
About this page
Tag09JP6G9FTA
URIm2://09JP6G9FTA
Kinddefinition
WritingW0 stub
MSC05C05
DefinesForest
UsesAcyclic graph, Tree

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.