M. Pasch

activity

20182026

most citedInference and mutual information on random factor graphs

4 citations · 6 across the 8 of their papers we have counts for

collaborators

Showing 2024Show all

3 papers · 1 filter

math.CO2024

Sharp Thresholds for Factors in Random Graphs

Fabian Burghart, Annika Heckel, Marc Kaufmann +2

Let $F$ be a graph on $r$ vertices and let $G$ be a graph on $n$ vertices. Then an $F$ -factor in $G$ is a subgraph of $G$ composed of $n / r$ vertex-disjoint copies of $F$ , if $r$ di…

math.CO2024

The hitting time of nice factors

Fabian Burghart, Marc Kaufmann, Noela Müller +1

Consider the random $u$ -uniform hypergraph (or $u$ -graph) process on $n$ vertices, where $n$ is divisible by $r > u \geq 2$ . It was recently shown that with high probability, as soon a…

math.CO2024

Loose Hamilton paths in the 3-uniform cube hypergraph

Oliver Cooley, Johannes Machata, Matija Pasch

It is well-known that the $d$ -dimensional hypercube contains a Hamilton cycle for $d \geq 2$ . In this paper we address the analogous problem in the $3$ -uniform cube hypergraph, a $3$ …