Bruno Jartoux

activity

20202022

collaborators

3 papers

math.CO2022

Conflict-Free Colouring of Subsets

Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky +1

We introduce and study conflict-free colourings of $t$ -subsets in hypergraphs. In such colourings, one assigns colours to all subsets of vertices of cardinality $t$ such that in an…

math.CO2021

On Multicolour Ramsey Numbers and Subset-Colouring of Hypergraphs

Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky +1

For $n \geq s > r \geq 1$ and $k \geq 2$ , write $n \to (s)_{k}^{r}$ if every hyperedge colouring with $k$ colours of the complete $r$ -uniform hypergraph on $n$ vertices has a mon…

cs.DM2020

The $ε$ - $t$ -Net Problem

Noga Alon, Bruno Jartoux, Chaya Keller +2

We study a natural generalization of the classical $ε$ -net problem (Haussler--Welzl 1987), which we call the " $ε$ - $t$ -net problem": Given a hypergraph on $n$ vertices and parameter…

Conflict-Free Colouring of Subsets

On Multicolour Ramsey Numbers and Subset-Colouring of Hypergraphs

The ε-t-Net Problem

The $ε$ - $t$ -Net Problem