The BEST theorem, in graph theory, gives a product formula for the number of Eulerian circuits in a directed graph. Its name is an acronym for its four discoverers, N. G. de Bruijn, Tatyana van Aardenne-Ehrenfest, Cedric Smith and W. T. Tutte, and the formula lets researchers compute how many distinct closed walks traverse every edge of a directed graph exactly once. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Statement Form Connections
Has Statement Form
In Branch
Source BEST theorem (Wikipedia)
Proved By
Source BEST theorem (Wikipedia)
Sources
1. BEST theorem (Wikipedia)
Lead section
In graph theory, a part of discrete mathematics, the BEST theorem gives a product formula for the number of Eulerian circuits in directed (oriented) graphs.
In Branch: Graph Theory, Lead sentence
In graph theory, a part of discrete mathematics, the BEST theorem gives a product formula for the number of Eulerian circuits in d
Proved By: W. T. Tutte, Lead paragraph
of people who discovered it: N. G. de Bruijn, Tatyana van Aardenne-Ehrenfest, Cedric Smith and W. T. Tutte.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.