Vincent Pfenninger

activity

20212025

most citedPerfect matchings in random sparsifications of Dirac hypergraphs

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

collaborators

4 papers

cs.DM2025

The random $k$ -SAT Gibbs uniqueness threshold revisited

Arnab Chatterjee, Amin Coja-Oghlan, Catherine Greenhill +4

We prove that for any $k \geq 3$ for clause/variable ratios up to the Gibbs uniqueness threshold of the corresponding Galton-Watson tree, the number of satisfying assignments of rand…

math.CO2023

A note on Hamilton decompositions of even-regular multigraphs

Vincent Pfenninger

In this note, we prove that every even regular multigraph on $n$ vertices with multiplicity at most $r$ and minimum degree at least $r n /2 + o (n)$ has a Hamilton decomposition. This…

math.CO2022★ 4 cited

Perfect matchings in random sparsifications of Dirac hypergraphs

Dong Yeap Kang, Tom Kelly, Daniela Kühn +2

For all integers $n \geq k > d \geq 1$ , let $m_{d} (k, n)$ be the minimum integer $D \geq 0$ such that every $k$ -uniform $n$ -vertex hypergraph $H$ with minimum $d$ -degree $δ…

math.CO2021

$1$ -independent percolation on $Z^{2} \times K_{n}$

Victor Falgas-Ravry, Vincent Pfenninger

A random graph model on a host graph H is said to be 1-independent if for every pair of vertex-disjoint subsets A,B of E(H), the state of edges (absent or present) in A is independ…

The random k-SAT Gibbs uniqueness threshold revisited

A note on Hamilton decompositions of even-regular multigraphs

Perfect matchings in random sparsifications of Dirac hypergraphs

1-independent percolation on Z2×Kn​

The random $k$ -SAT Gibbs uniqueness threshold revisited

$1$ -independent percolation on $Z^{2} \times K_{n}$