Philipp Sprüssel - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2022

Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial ComplexesOliver Cooley, Nicola Del Giudice, Mihyun Kang, Philipp Sprüssel. combinatorics, 29(3), 2022. [doi]

2020

Vanishing of cohomology groups of random simplicial complexesOliver Cooley, Nicola Del Giudice, Mihyun Kang, Philipp Sprüssel. rsa, 56(2):461-500, 2020. [doi]

Phase transitions in graphs on orientable surfacesMihyun Kang, Michael Moßhammer, Philipp Sprüssel. rsa, 56(4):1117-1170, July 2020. [doi]

2018

2017

Homological connectedness of random hypergraphsOliver Cooley, Penny Haxell, Mihyun Kang, Philipp Sprüssel. endm, 61:279-285, 2017. [doi]

The evolution of random graphs on surfacesChris Dowden, Mihyun Kang, Philipp Sprüssel. endm, 61:367-373, 2017. [doi]

Evolution of the giant component in graphs on orientable surfacesMihyun Kang, Michael Moßhammer, Philipp Sprüssel. endm, 61:687-693, 2017. [doi]

2015

Two Disjoint Independent Bases in Matroid-Graph PairsRon Aharoni, Eli Berger, Philipp Sprüssel. gc, 31(5):1107-1116, 2015. [doi]

Cooperative Colorings and Independent Systems of RepresentativesRon Aharoni, Ron Holzman, David Howard, Philipp Sprüssel. combinatorics, 22(2):2, 2015. [doi]

Characterisation of symmetries of unlabelled triangulationsMihyun Kang, Philipp Sprüssel. endm, 49:587-594, 2015. [doi]

Enumeration of cubic multigraphs on orientable surfacesMihyun Kang, Michael Moßhammer, Philipp Sprüssel, W. Fang. endm, 49:603-610, 2015. [doi]

2012

Locally finite graphs with ends: A topological approach, III. Fundamental group and homologyReinhard Diestel, Philipp Sprüssel. DM, 312(1):21-29, 2012. [doi]

2011

The Max-Flow Min-Cut theorem for countable networksRon Aharoni, Eli Berger, Agelos Georgakopoulos, Amitai Perlstein, Philipp Sprüssel. JCT, 101(1):1-17, 2011. [doi]

Twins of rayless graphsAnthony Bonato, Henning Bruhn, Reinhard Diestel, Philipp Sprüssel. JCT, 101(1):60-65, 2011. [doi]

2010

Every rayless graph has an unfriendly partitionHenning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel. combinatorica, 30(5):521-532, 2010. [doi]

The homology of a locally finite graph with endsReinhard Diestel, Philipp Sprüssel. combinatorica, 30(6):681-714, 2010. [doi]

2009

Perfect matchings in r-partite r-graphsRon Aharoni, Agelos Georgakopoulos, Philipp Sprüssel. ejc, 30(1):39-42, 2009. [doi]

Every rayless graph has an unfriendly partitionHenning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel. endm, 34:279-281, 2009. [doi]

Geodetic Topological Cycles in Locally Finite GraphsAgelos Georgakopoulos, Philipp Sprüssel. combinatorics, 16(1), 2009. [doi]

2008

Strongly Maximal Matchings in Infinite GraphsRon Aharoni, Eli Berger, Agelos Georgakopoulos, Philipp Sprüssel. combinatorics, 15(1), 2008. [doi]

End spaces of graphs are normalPhilipp Sprüssel. JCT, 98(4):798-804, 2008. [doi]

Sign in or sign up to see more results.

runs on WebDSL