
Mathematical Research Seminar - Archive
2025 | 2024 | 2023 | 2022 | 2021 | 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 |
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 |
Datum in ura / Date and time: 24.2.25
(15:00-16:00)
Predavalnica / Location: FAMNIT-RLab5
Predavatelj / Lecturer: Tilen Gimpelj (University of Primorska)
Naslov / Title: From LaTeX to Typst: Simplifying Professional Typesetting
Vsebina / Abstract:
About Typst: Typst is a new open-source markup-based typesetting system that is designed to be as powerful as LaTeX while being much easier to learn and use. Typst creates beautiful PDF output with blazing-fast render times.
Datum in ura / Date and time: 10.2.25
(15:00-16:00)
Predavalnica / Location: FAMNIT-MP1
Predavatelj / Lecturer: Attila Joó (University of Hamburg)
Naslov / Title: Highly connected infinite digraphs without edge-disjoint back and forth paths between a certain vertex pair
Vsebina / Abstract:
A theorem of Mader states that in every finite (k+1)-edge-connected digraph D, for any s, t ∈ V(D), there exists an st-path P such that D - E(P) remains k-edge-connected. We show that this result does not extend to infinite digraphs and can fail drastically. Specifically, for every k ∈ ℕ, we construct a "fractal-like" infinite k-edge-connected digraph Dk with s, t ∈V(Dk), in which every st-path shares an edge with every ts-path.