2 citations · 7 across the 20 of their papers we have counts for
20 papers
Hadwiger's conjecture for hypergraphs
Dominic van der Zypen
In 1943, Hadwiger formulated his celebrated conjecture, connecting the chromatic number of a finite, simple, undirected graph with the cardinality of the largest complete mi…
The matroid intersection conjecture
Dominic van der Zypen
We prove the matroid intersection conjecture, due to Nash-Williams \cite{ahaziv}, for infinite matroids: If are matroids for , both havin…
Dominic van der Zypen
We show that the selection principles and are not equal constructing a topological space that satisfies , but not .…
Heritability of Kőnig's Property from finite edge sets
Marc Kaufmann, Dominic van der Zypen
A hypergraph is said to have Kőnig's Property if there is a matching and such that for all , and is a vertex…
Knuth's non-associative "group" on
Dominic van der Zypen
Donald Knuth introduced in The Art of Computer Programming (Vol 4a) a fast approximation to the addition of integers (given in binary) in terms of bit-wise operations by $a + b \;…
Counterexample to a conjecture of Aharoni and Korman
Dominic van der Zypen
Ron Aharoni and Vladimir Korman conjectured that any hypergraph with only finite edges has a strongly minimal cover. We present a counterexample.