Profile Picture

Jochen Pascal Gollin

FAMNIT, University of Primorska
Glagoljaška ulica 8
6000 Koper, Slovenia

Office: II-14, Galeb (Kettejeva ulica 1)

Email: pascal.gollin@famnit.upr.si

Google Scholar  OrcID  arXiv

about me

I am a Postdoc at FAMNIT at the University of Primorska, Slovenia. I work in graph theory with a focus on structural graph theory of both finite and infinite graphs. I obtained my PhD in mathematics in 2019 from the University of Hamburg, under the supervision of Reinhard Diestel. From 2019 to 2024, I was a research fellow in the Discrete Mathematics Group (DIMAG), which is part of the Pioneer Research Center for Mathematical and Computational Sciences within the Institute for Basic Science (IBS) in South Korea.

my publications

  1. Dominated balanced separators in wheel-induced-minor-free graphs
    with Maria Chudnovsky, Matjaž Krnc, and Martin Milanič.
    Preprint, December 2025.  arXiv

  2. On {k}-Roman graphs
    with Kenny Bešter Štorgel, Nina Chiarelli, Lara Fernandez, Claire Hilaire, Valeria Leoni, and Martin Milanič.
    Preprint, November 2025.  arXiv
    Extended abstract published in:
    Proceedings of the XIII Latin American Algorithms, Graphs, and Optimization Symposium (LAGOS 2025), Procedia Computer Science, 273:325-332, November 2025. doi

  3. The Erdős-Pósa property for circle graphs as vertex-minors
    with Rutger Campbell, Meike Hatzel, O-joung Kwon, Rose McCarty, Sang-il Oum, and Sebastian Wiederrecht.
    Preprint, June 2025.  arXiv
    Extended abstract to be published in:
    Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2026.

  4. On graphs with a simple structure of maximal cliques
    with Meike Hatzel and Sebastian Wiederrecht.
    Preprint, April 2025.  arXiv

  5. Wild generalised truncations of infinite matroids
    with Attila Joó.
    Preprint, April 2025.  arXiv
    Extended abstract published in:
    Proceedings of the 13th European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'25), see here, August 2025.

  6. Treewidth, induced grid minors, and Hadwiger number
    with Rutger Campbell, James Davies, Marc Distel, Bryce Frederickson, Kevin Hendrey, Robert Hickingbotham, Sebastian Wiederrecht, David R. Wood, and Liana Yepremyan.
    Preprint, October 2024.  arXiv

  7. Clustered colourings of graph products
    with Rutger Campbell, Kevin Hendrey, Thomas Lesgourgues, Bojan Mohar, Youri Tamitegama, Jane Tan, and David R. Wood.
    Electronic Journal of Combinatorics 32(3): P3.15, 24 pp, July 2025 (Preprint date: July 2024).  arXiv doi

  8. A coarse Erdős-Pósa theorem
    with Jungho Ahn, Tony Huynh, and O-joung Kwon.
    Preprint, July 2024.  arXiv
    Extended abstract published in:
    Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 3363 - 3381, January 2025. doi

  9. Optimal bounds for zero-sum cycles. I. Odd order
    with Rutger Campbell, Kevin Hendrey, and Raphael Steiner.
    Journal of Combinatorial Theory Series B 173: 246-256, July 2025 (Preprint date: June 2024).  arXiv doi

  10. Sharing tea on a graph
    with Kevin Hendrey, Hao Huang, Tony Huynh, Bojan Mohar, Sang-il Oum, Ningyuan Yang, Wei-Hsuan Yu, and Xuding Zhu.
    Preprint, May 2024.  arXiv

  11. Linear bounds on treewidth in terms of excluded planar minors
    with Kevin Hendrey, Sang-il Oum, and Bruce Reed.
    Electronic Journal of Combinatorics 32(4): P4.68, 23 pp, December 2025 (Preprint date: February 2024).  arXiv doi

  12. Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
    with Sebastian Wiederrecht.
    Preprint, April 2023.  arXiv

  13. Matching variables to equations in infinite linear equation systems
    with Attila Joó.
    Linear Algebra and its Applications 660: 40-46, March 2023 (Preprint date: November 2022).  arXiv doi

  14. Graphs of linear growth have bounded treewidth
    with Rutger Campbell, Marc Distel, Daniel J. Harvey, Kevin Hendrey, Robert Hickingbotham, Bojan Mohar, and David R. Wood.
    Electronic Journal of Combinatorics 30(3): P3.1, 12 pp, July 2023 (Preprint date: October 2022).  arXiv doi

  15. A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
    with Kevin Hendrey, O-joung Kwon, Sang-il Oum, and Youngho Yoo.
    Mathematische Annalen 393(2): 2507-2559, October 2025 (Preprint date: September 2022).  arXiv doi

  16. Product structure of graph classes with bounded treewidth
    with Rutger Campbell, Katie Clinch, Marc Distel, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, and David R. Wood.
    Combinatorics, Probability and Computing 33(3): 351-376, May 2024 (Preprint date: June 2022).  arXiv doi
    Extended abstract published as a chapter in:
    2021-2022 MATRIX Annals, pages 171-185 doi

  17. Disjoint dijoins for classes of dicuts in finite and infinite digraphs
    with Karl Heuer and Konstantinos Stavropoulos.
    Combinatorial Theory 2(3): #16, 21pp, October 2022 (Preprint date: September 2021).  arXiv doi

  18. Counting cliques in 1-planar graphs
    with Kevin Hendrey, Abhishek Methuku, Casey Tompkins, and Xin Zhang.
    European Journal of Combinatorics 109: 103654, 27 pp, March 2023 (Preprint date: September 2021).  arXiv doi

  19. A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
    with Kevin Hendrey, Ken-ichi Kawarabayashi, O-joung Kwon, and Sang-il Oum.
    Journal of the London Mathematical Society 109(1): e12858, 35 pp, January 2024 (Preprint date: February 2021).  arXiv doi

  20. Ubiquity of graphs with extensive tree-decompositions
    with Nathan Bowler, Christian Elbracht, Joshua Erde, Karl Heuer, Max Pitz, and Maximilian Teegen.
    Combinatorial Theory 4(2): #3, 52pp, September 2024 (Preprint date: December 2020).  arXiv doi

  21. Obstructions for bounded branch-depth in matroids
    with Kevin Hendrey, Dillon Mayhew, and Sang-il Oum.
    Advances in Combinatorics: 2021:4, 25 pp, May 2021 (Preprint date: March 2020).  arXiv doi

  22. Enlarging vertex-flames in countable digraphs
    with Joshua Erde and Attila Joó.
    Journal of Combinatorial Theory Series B 151: 263-281, November 2022 (Preprint date: March 2020).  arXiv doi

  23. Base partition for finitary-cofinatary matroid families
    with Joshua Erde, Attila Joó, Paul Knappe, and Max Pitz.
    Combinatorica 41(1): 31-52, February 2021 (Preprint date: October 2019).  arXiv doi

  24. On the Infinite Lucchesi-Younger Conjecture I
    with Karl Heuer.
    Journal of Graph Theory 98(1): 27-48, May 2023 (Preprint date: September 2019).  arXiv doi

  25. Representations of infinite tree sets
    with Jakob Kneip.
    Order 38(1): 79-96, April 2021 (Preprint date: August 2019).  arXiv doi

  26. A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
    with Joshua Erde, Attila Joó, Paul Knappe, and Max Pitz.
    Journal of Combinatorial Theory Series B 149: 16-22, February 2023 (Preprint date: June 2019).  arXiv doi

  27. Characterising k-connected sets in infinite graphs
    with Karl Heuer.
    Journal of Combinatorial Theory Series B 157: 451-499, November 2022 (Preprint date: November 2018).  arXiv doi

  28. Ubiquity of graphs with nowhere-linear end structure
    with Nathan Bowler, Christian Elbracht, Joshua Erde, Karl Heuer, Max Pitz, and Maximilian Teegen.
    Journal of Graph Theory 103(3): 564-598, February 2023 (Preprint date: September 2018).  arXiv doi

  29. Topological ubiquity of trees
    with Nathan Bowler, Christian Elbracht, Joshua Erde, Karl Heuer, Max Pitz, and Maximilian Teegen.
    Journal of Combinatorial Theory Series B 157: 70-95, November 2022 (Preprint date: June 2018).  arXiv doi

  30. An analogue of Edmonds’ Branching Theorem for infinite digraphs
    with Karl Heuer.
    European Journal of Combinatorics 92: 103182, 14 pp, February 2021 (Preprint date: May 2018).  arXiv doi

  31. Infinite end-devouring sets of rays with prescribed start vertices
    with Karl Heuer.
    Discrete Mathematics 341(7): 2117-2120, July 2019 (Preprint date: April 2017).  arXiv doi

  32. Canonical tree-decompositions of a graph that display its k-blocks
    with Johannes Carmesin.
    Journal of Combinatorial Theory Series B 122: 1-20, January 2017 (Preprint date: June 2015).  arXiv doi

my thesis