Author

Jorik Jooken

h-index 7 View on Semantic Scholar

We have 3 of 48 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Counterexamples to the Albertson-Berman conjecture: minimum order, connectivity and an improved ratio bound

In 1979, Albertson and Berman conjectured that every planar graph $G$ contains an induced forest of order at least $|V(G)|/2$. This long-standing conjecture was recently disproved by several explicit counterexamples, which naturally led to several extremal and structural questions that we answer. We combine mathematica...

W. Cames van Batenburg, J. Goedgebeur, Jorik Jooken · 0 citations

Preprint Aug 2026

Disproving the Petersen Coloring Conjecture: Theoretical Analysis and an Infinite Family of Counterexamples

In 1988, Jaeger conjectured that every bridgeless cubic graph $G$ admits a Petersen coloring; that is, a map $E(G) \to E(P)$ mapping any two adjacent edges of $G$ to two adjacent edges of the Petersen graph $P$. A positive resolution to Jaeger's conjecture would have immediately resolved several other famous and long-s...

J. Goedgebeur, Jorik Jooken, Edita Máčajová et al. · 0 citations

Preprint Aug 2026

A human-checkable proof of the 112-vertex counterexample to the Petersen coloring conjecture

The Petersen coloring conjecture of Jaeger asserts that every bridgeless cubic graph admits a Petersen coloring. Recently, Putman presented an explicit counterexample on $112$ vertices and verified its non-colorability by showing, using a SAT solver, that an instance with $3640$ variables and $68324$ clauses is unsatis...

Jorik Jooken · 0 citations