de Bruijn–van Aardenne–Ehrenfest theorem

The de Bruijn–van Aardenne–Ehrenfest theorem is a fundamental result in combinatorics that characterizes the number of Eulerian circuits in directed graphs, particularly de Bruijn graphs, and underpins constructions in coding theory and discrete mathematics.

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.