Lesson plan

Digraph realization problem

and outdegree of a given vertex respectively. The problem asks whether a given list of pairs can be used to construct a graph, and for the list above, the answer is yes. The digraph realization problem is a decision problem in graph theory. Given pairs of nonnegative integers ((a_1,b_1),\ldots,(a_n,b_n)) , the problem asks whether there is a labeled simple directed graph such that each vertex v_i has indegree a_i and outdegree b_i .

Back to article

Article summary

and outdegree of a given vertex respectively. The problem asks whether a given list of pairs can be used to construct a graph, and for the list above, the answer is yes. The digraph realization problem is a decision problem in graph theory. Given pairs of nonnegative integers ((a_1,b_1),\ldots,(a_n,b_n)) , the problem asks whether there is a labeled simple directed graph such that each vertex v_i has indegree a_i and outdegree b_i .

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. 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.