3 citations · 7 across the 12 of their papers we have counts for
9 papers · 1 filter
On the maximum number of copies of H in graphs with given size and order
Dániel Gerbner, Dániel T. Nagy, Balázs Patkós +1
We study the maximum number of copies of a graph in graphs with given number of vertices and edges. We show that for any fixed graph , is asymptotica…
On Clique Coverings of Complete Multipartite Graphs
Akbar Davoodi, Dániel Gerbner, Abhishek Methuku +1
A clique covering of a graph is a set of cliques of such that any edge of is contained in one of these cliques, and the weight of a clique covering is the sum of the si…
Rainbow Ramsey problems for the Boolean lattice
Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li +4
We address the following rainbow Ramsey problem: For posets what is the smallest number such that any coloring of the elements of the Boolean lattice either admits…
Universal Scaling Laws for Shear Induced Dilation in Frictional Granular Media
Mahesh M. Bandi, Prasenjit Das, Oleg Gendelman +2
Compressed frictional granular matter cannot flow without dilation. Upon forced shearing to generate flow, the amount of dilation may depend on the initial preparation and a host o…
Vertex Turán problems for the oriented hypercube
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy +2
In this short note we consider the oriented vertex Turán problem in the hypercube: for a fixed oriented graph , determine the maximum size $ex_v(\overrightarrow…
The variety of domination games
Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +6
Domination game [SIAM J.\ Discrete Math.\ 24 (2010) 979--991] and total domination game [Graphs Combin.\ 31 (2015) 1453--1462] are by now well established games played on graphs by…