You are not logged in |
COUNTING PATHS IN DIRECTED GRAPHS
- Speaker(s)
- PIOTR M. HAJAC
- Affiliation
- IMPAN
- Date
- Oct. 26, 2022, 5:15 p.m.
- Information about the event
- ZOOM
- Seminar
- North Atlantic Noncommutative Geometry Seminar
We consider the class of directed graphs with N edges and without loops shorter than k. Using the concept of a labelled graph and a recent result of Alexandru Chirvasitu, I will show how to determine graphs from this class (they can be viewed as graphs labelled by the semiring of natural numbers) that maximize the number of all paths of length k. Then I will explain how to obtain an R-labelled version of this result for semirings R contained in the semiring of non-negative real numbers and containing the semiring of non-negative rational numbers. (Based on joint work with Oskar Stachowiak inspired by joint work with Alexandru Chirvasitu.)
