16 citations · 192 across the 105 of their papers we have counts for
9 papers · 1 filter
Sharper Zarankiewicz and Diagonal Bipartite Ramsey Bounds
Dhruv Mubayi
We prove that there is an absolute positive constant such that every bipartite graph with vertices in each part and at least edges contains a complete bipartite gra…
Erdős-Sós for digraphs
Dhruv Mubayi, Jacques Verstraete
It is shown that every Eulerian digraph on vertices with more than arcs contains every oriented tree with edges. The digraphs have no loops or repeated arcs, but o…
Maximizing in graphs with fixed edge density
József Balogh, Andrzej Grzesik, Bernard Lidický +3
For every integer , and , we asymptotically determine the maximum proportion of -element sets of vertices that induce either a clique or an independent set in…
Kalai's Conjecture for Tight Trees
Dhruv Mubayi, Jacques Verstraete
Let and . It is shown that if is an -uniform tight tree with edges and is a -free -uniform hypergraph, then , wher…
Forcing monochromatic subdivisions
Gabriel Collado, Dhruv Mubayi
We prove that for every integers and there exists an integer , that depends only on and , such that for every graph with maximum degree at most …
On the maximum density of -graphs in which every -set spans or edges
Vishesh Jain, Haoran Luo, Dhruv Mubayi
In 1984, Frankl and Füredi asked for the maximum density of an -vertex -graph in which every -set of vertices spans or edges. They gave a construction with asy…