D. Mubayi

activity

20242026

most citedConflict-free Hypergraph Matchings and Coverings

1 citations · 1 across the 2 of their papers we have counts for

collaborators

14 papers

math.CO2026★ 1 cited

Conflict-free Hypergraph Matchings and Coverings

Felix Joos, Dhruv Mubayi, Zak Smith

Recent work showing the existence of conflict-free almost-perfect hypergraph matchings has found many applications. We show that, assuming certain simple degree and codegree condit…

math.CO2026

On the maximum density of $r$ -graphs in which every $(r + 1)$ -set spans $0$ or $2$ edges

Vishesh Jain, Haoran Luo, Dhruv Mubayi

In 1984, Frankl and FÃ¼redi asked for the maximum density of an $n$ -vertex $r$ -graph in which every $(r + 1)$ -set of vertices spans $0$ or $2$ edges. They gave a construction with as…

math.CO2026

The number $4/9$ is a non-jump for $3$ -graphs

Xizhi Liu, Dhruv Mubayi

We prove that $4/9$ is a non-jump for $3$ -uniform hypergraphs. Our construction perturbs the $A B B$ pattern by inserting, inside the $B$ -part, the union of a high-cogirth pair of St…

math.CO2026

The largest $K_{r}$ -free set of vertices in a random graph

Tom Bohman, Marcus Michelen, Dhruv Mubayi

For $r \geq 2$ and a graph $G$ , let $I^\pm_{r} (G)$ be the maximum number of vertices in a $K_{r}$ -free subgraph of $G$ . We investigate the value $I^\pm_{r} (G)$ when $G$ is the random graph…

math.CO2026

Semi-Inducibility of some small graphs

JÃ³zsef Balogh, Bernard LidickÃ½, Dhruv Mubayi +2

Let $H$ be a fixed graph whose edges are colored red and blue and let $I^^{2} \in [0, 1]$ . Let $I (H, I^^{2})$ be the (asymptotically normalized) maximum number of copies of $H$ in a large re…

math.CO2025

A question of ErdÅs and Graham on Egyptian fractions

David Conlon, Jacob Fox, Xiaoyu He +4

Answering a question of ErdÅs and Graham, we show that for each fixed positive rational number $x$ the number of ways to write $x$ as a sum of reciprocals of distinct positive int…

Conflict-free Hypergraph Matchings and Coverings

On the maximum density of r-graphs in which every (r+1)-set spans 0 or 2 edges

The number 4/9 is a non-jump for 3-graphs

The largest Kr​-free set of vertices in a random graph

Semi-Inducibility of some small graphs

A question of ErdÅs and Graham on Egyptian fractions

On the maximum density of $r$ -graphs in which every $(r + 1)$ -set spans $0$ or $2$ edges

The number $4/9$ is a non-jump for $3$ -graphs

The largest $K_{r}$ -free set of vertices in a random graph

A question of ErdÅs and Graham on Egyptian fractions