Paul Horn

activity

20142025

most citedAn upper bound on the extremal version of Hajnal's triangle-free game

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

cs.CG2025

Matching random colored points with rectangles (Corrigendum)

Josué Corujo, Paul Horn, Pablo Pérez-Lantero

Given $n > 0$ , let $S \subset [0, 1]^{2}$ be a set of $n$ points, chosen uniformly at random. Let $R \cup B$ be a random partition, or coloring, of $S$ in which each point of $S$ is inclu…

math.CO2023

Covering triangular grids with multiplicity

Abdul Basit, Alexander Clifton, Paul Horn

Motivated by classical work of Alon and Füredi, we introduce and address the following problem: determine the minimum number of affine hyperplanes in $R^{d}$ needed to cover…

math.CO2014★ 1 cited

An upper bound on the extremal version of Hajnal's triangle-free game

Csaba Biró, Paul Horn, D. Jacob Wildstrom

A game starts with the empty graph on $n$ vertices, and two player alternate adding edges to the graph. Only moves which do not create a triangle are valid. The game ends when a ma…