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 2015 · math.COShow all

10 papers · 2 filters

math.CO2015

Multicolor Sunflowers

Dhruv Mubayi, Lujia Wang

A sunflower is a collection of distinct sets such that the intersection of any two of them is the same as the common intersection $C$ of all of them, and $∣ C ∣$ is smaller than each…

math.CO2015★ 3 cited

The number of trees in a graph

Dhruv Mubayi, Jacques Verstraete

Let $T$ be a tree with $t$ edges. We show that the number of isomorphic (labeled) copies of $T$ in a graph $G = (V, E)$ of minimum degree at least $t$ is at least \[2|E| \prod_{v \i…

math.CO2015★ 3 cited

Improved bounds for the Ramsey number of tight cycles versus cliques

Dhruv Mubayi

The 3-uniform tight cycle $C_{s}^{3}$ has vertex set $Z_{s}$ and edge set ${{i, i + 1, i + 2} : i \in Z_{s}}$ . We prove that for every $s \neq \equiv 0$ (mod 3) and $s \geq 16$ or $s \in \{8…

math.CO2015

Constructions in Ramsey theory

Dhruv Mubayi, Andrew Suk

We provide several constructions for problems in Ramsey theory. First, we prove a superexponential lower bound for the classical 4-uniform Ramsey number $r_{4} (5, n)$ , and the same fo…

math.CO2015

A survey of Turán problems for expansions

Dhruv Mubayi, Jacques Verstraete

The $r$ -expansion $G^{+}$ of a graph $G$ is the $r$ -uniform hypergraph obtained from $G$ by enlarging each edge of $G$ with a vertex subset of size $r - 2$ disjoint from $V (G)$ such th…

math.CO2015

Off-diagonal hypergraph Ramsey numbers

Dhruv Mubayi, Andrew Suk

The Ramsey number $r_{k} (s, n)$ is the minimum $N$ such that every red-blue coloring of the $k$ -subsets of ${1, \dots, N}$ contains a red set of size $s$ or a blue set of size $n$ ,…