research
∙
03/17/2023
Characterisation of the big Ramsey degrees of the generic partial order
As a result of 33 intercontinental Zoom calls, we characterise big Ramse...
share
research
∙
06/30/2022
Bounding and computing obstacle numbers of graphs
An obstacle representation of a graph G consists of a set of pairwise di...
research
∙
03/14/2022
Erdős–Szekeres-type problems in the real projective plane
We consider point sets in the real projective plane ℝP^2 and explore var...
research
∙
01/19/2022
On off-diagonal ordered Ramsey numbers of nested matchings
For two graphs G^< and H^< with linearly ordered vertex sets, the ordere...
research
∙
11/24/2021
Tight bounds on the expected number of holes in random point sets
For integers d ≥ 2 and k ≥ d+1, a k-hole in a set S of points in general...
research
∙
08/17/2021
Implementation of Sprouts: a graph drawing game
Sprouts is a two-player pencil-and-paper game invented by John Conway an...
research
∙
05/25/2021
Big Ramsey degrees and forbidden cycles
Using the Carlson-Simpson theorem, we give a new general condition for a...
research
∙
05/21/2021
Big Ramsey degrees of the generic partial order
As a result of 33 intercontinental Zoom calls, we characterise big Ramse...
research
∙
08/01/2020
Big Ramsey degrees of 3-uniform hypergraphs are finite
We prove that the universal homogeneous 3-uniform hypergraph has finite ...
research
∙
03/02/2020
Holes and islands in random point sets
For d ∈ℕ, let S be a finite set of points in ℝ^d in general position. A ...
research
∙
08/14/2019
Minimal Representations of Order Types by Geometric Graphs
In order to have a compact visualization of the order type of a given po...
research
∙
06/10/2019
