Welcome to FlowProblem.ru. This is a non-profit web-project which is developed by The Department of Applied Mathematics and Сybernetics of Petrozavodsk State University. The project is devoted to Graph Theory and Combinatorics. See “About” section for more information about the authors.

The main idea of our site is to give some information about hard problems of Enumerative Combinatorics. There we store some results, which were obtained by our scientific group.

The main results are related to counting cycles in some special kinds of graphs: chess graphs, rectangular lattices, cylinders, tores, 3-dimensional product graphs and so on. Also we are interested in counting short-length cycles using our explicit formulae.