Jacques Verstraëte

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2010

The de Bruijn-Erdos Theorem for Hypergraphs

Noga Alon, Keith E. Mellinger, Dhruv Mubayi +1

Fix integers $n \geq r \geq 2$ . A clique partition of $(r [ n ])$ is a collection of proper subsets $A_{1}, A_{2}, \dots, A_{t} \subset [n]$ such that $⋃_{i} (r A _{i})$ is…

math.CO2010

The de Bruijn-Erdos Theorem for hypergraphs

Keith Mellinger, Dhruv Mubayi, Jacques Verstraete

Fix integers $n \geq r \geq 2$ . A clique partition of $(r [ n ])$ is a collection of proper subsets $A_{1}, A_{2}, ..., A_{t} \subset [n]$ such that $⋃_{i} (r A _{i})$ is a p…