Construct · 1 fields · 1 citations

Tutte theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
Tuttetheorem1 CONSTRUCTTutte theoremTUTTE · GRAPH THEORY

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Graph theory

theorem that a graph has a perfect matching exactly when removing any vertex set leaves no more odd components than vertices removed.

In graph theory, Tutte theorem refers to theorem that a graph has a perfect matching exactly when removing any vertex set leaves no more odd components than vertices removed. This meaning comes from Tutte (1947) in Journal of the London Mathematical Society.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how Tutte theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

matching4 fields · 4 citationsjingle · one word, four constructs

References

  1. Tutte, W. T. (1947). The Factorization of Linear Graphs. Journal of the London Mathematical Society, s1-22(2), 107-111. https://doi.org/10.1112/jlms/s1-22.2.107

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct