J. Håstad

activity

20082025

most citedExplicit two-deletion codes with redundancy matching the existential bound

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

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2024

A logarithmic approximation of linearly ordered colourings

Johan Håstad, Björn Martinsson, Tamio-Vesa Nakajima +1

A linearly ordered (LO) $k$ -colouring of a hypergraph assigns to each vertex a colour from the set ${0, 1, \dots, k - 1}$ in such a way that each hyperedge has a unique maximum eleme…

math.CO2019

$d$ -Galvin families

Johan Håstad, Guillaume Lagarde, Joseph Swernofsky

The Galvin problem asks for the minimum size of a family $F \subseteq (n /2 [ n ])$ with the property that, for any set $A$ of size $\frac{n}{2}$ , there is a set $S \in…

A logarithmic approximation of linearly ordered colourings

d-Galvin families

$d$ -Galvin families