Jacques Verstraëte

collaborators

3 papers

math.CO2010

Cycles in Sparse Graphs II

Jacques Verstraete, Benny Sudakov

The {\em independence ratio} of a graph $G$ is defined by \[ ι(G) := \sup_{X \subset V(G)} \frac{|X|}{α(X)},\] where $α (X)$ is the independence number of the subgraph of $G$ induce…

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…