Követés
Dániel Gerbner
Dániel Gerbner
Rényi Institute
E-mail megerősítve itt: renyi.hu - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
Extremal results for Berge hypergraphs
D Gerbner, C Palmer
SIAM Journal on Discrete Mathematics 31 (4), 2314-2327, 2017
702017
Counting copies of a fixed subgraph in F-free graphs
D Gerbner, C Palmer
European Journal of Combinatorics 82, 103001, 2019
602019
Generalized Turán problems for even cycles
D Gerbner, E Győri, A Methuku, M Vizer
Journal of Combinatorial Theory, Series B 145, 169-213, 2020
542020
Extremal finite set theory
D Gerbner, B Patkós
Chapman and Hall/CRC, 2018
512018
Asymptotics for the Turán number of Berge-K2, t
D Gerbner, A Methuku, M Vizer
Journal of Combinatorial Theory, Series B 137, 264-290, 2019
442019
Partitioning 2-edge-colored graphs by monochromatic paths and cycles
J Balogh, J Barát, D Gerbner, A Gyárfás, GN Sárközy
Combinatorica 34 (5), 507-526, 2014
412014
General lemmas for Berge–Turán hypergraph problems
D Gerbner, A Methuku, C Palmer
European Journal of Combinatorics 86, 103082, 2020
392020
Generalized Turán problems for disjoint copies of graphs
D Gerbner, A Methuku, M Vizer
Discrete Mathematics 342 (11), 3130-3141, 2019
302019
Edge-decomposition of graphs into copies of a tree with four edges
J Barát, D Gerbner
arXiv preprint arXiv:1203.1671, 2012
292012
Saturating sperner families
D Gerbner, B Keszegh, N Lemons, C Palmer, D Pálvölgyi, B Patkós
Graphs and Combinatorics 29 (5), 1355-1364, 2013
252013
Almost intersecting families of sets
D Gerbner, N Lemons, C Palmer, B Patkós, V Szécsi
SIAM Journal on Discrete Mathematics 26 (4), 1657-1669, 2012
192012
Some exact results for generalized Turán problems
D Gerbner, C Palmer
European Journal of Combinatorics 103, 103519, 2022
152022
Ramsey problems for Berge hypergraphs
D Gerbner, A Methuku, G Omidi, M Vizer
SIAM Journal on Discrete Mathematics 34 (1), 351-369, 2020
142020
Generalized Tur\'an problems for small graphs
D Gerbner
arXiv preprint arXiv:2006.16150, 2020
132020
Density-based group testing
D Gerbner, B Keszegh, D Pálvölgyi, G Wiener
Information theory, combinatorics, and search theory, 543-556, 2013
13*2013
Linearity of saturation for Berge hypergraphs
S English, D Gerbner, A Methuku, M Tait
European Journal of Combinatorics 78, 205-213, 2019
112019
Profile polytopes of some classes of families
D Gerbner
Combinatorica 33 (2), 199-216, 2013
112013
Majority and plurality problems
D Gerbner, GOH Katona, D Pálvölgyi, B Patkós
Discrete Applied Mathematics 161 (6), 813-818, 2013
112013
On the number of cycles in a graph with restricted cycle lengths
D Gerbner, B Keszegh, C Palmer, B Patkós
SIAM Journal on Discrete Mathematics 32 (1), 266-279, 2018
102018
Finding a non-minority ball with majority answers
D Gerbner, B Keszegh, D Pálvölgyi, B Patkós, M Vizer, G Wiener
Discrete Applied Mathematics 219, 18-31, 2017
102017
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20