BEST theorem

In graph theory, a part of discrete mathematics, the BEST theorem gives a product formula for the number of Eulerian circuits in directed (oriented…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

We introduce a general framework for de Finetti reduction results, applicable to various notions of partially exchangeable…

2016

It is well-known that the Chinese Postman Problem on undirected and directed graphs is polynomial-time solvable. We extend this…

2016

A cost Markov chain is a Markov chain whose transitions are labelled with non-negative integer costs. A fundamental problem on…

2014

We consider a chip-firing game on finite directed graphs and give an answer to a question posed by Bjorner, Lovasz, and Shor in…

2012

In this paper we obtain the expectation and variance of the number of Euler tours of a random Eulerian directed graph with fixed…

2003

In this note we modify a new technique of Enflo for producing hyperinvariant subspaces to obtain a much improved version of his…

2003

We derive an alternative formula for the number of Euler trails on strongly connected directed pseudographs whose every vertex…