D. Mubayi

activity

19982026

most citedA unified approach to hypergraph stability

16 citations · 192 across the 105 of their papers we have counts for

collaborators

Showing 2010Show all

5 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…

math.CO2010★ 2 cited

Toward a Hajnal-Szemeredi theorem for hypergraphs

Hal Kierstead, Dhruv Mubayi

Let $H$ be a triple system with maximum degree $d > 1$ and let $r > 1 0^{7} d lo g^{2} d$ . Then $H$ has a proper vertex coloring with $r$ colors such that any two color classes differ…

math.CO2010

Almost all triple systems with independent neighborhoods are semi-bipartite

Jozsef Balogh, Dhruv Mubayi

The neighborhood of a pair of vertices $u, v$ in a triple system is the set of vertices $w$ such that $uv w$ is an edge. A triple system $\HH$ is semi-bipartite if its vertex set con…

math.CO2010

Books vs Triangles

Dhruv Mubayi

A book of size b in a graph is an edge that lies in b triangles. Consider a graph G with n vertices and \lfloor n^2/4\rfloor +1 edges. Rademacher proved that G contains at least \l…