Dániel Gerbner
|
Address Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences H-1053 Budapest, Reáltanoda u. 13-15. e-mail: gerbner.daniel@renyi.mta.hu Curriculum Vitae Publications D. Gerbner: Egy extremális probléma, Matematikai Lapok 2000-2001/2 (2005), 5-12. pdf A. Bernáth, D. Gerbner: Chain intersecting families, Graphs and Combinatorics 23 (2007) 353-366. pdf D. Gerbner, B. Patkós: l-chain profile vectors, SIAM J. Discrete Math. 22 (2008) 185-193. pdf D. Gerbner, B. Patkós: Profile vectors in the lattice of subspaces, Discrete Mathematics 309 (2009) 2861-2869. pdf D. Gerbner, D. Pálvölgyi, B. Patkós, G. Wiener: Finding the maximum and minimum elements with one lie, Discrete Applied Mathematics 158/9 (2010) pdf D. Gerbner, B. Keszegh, N. Lemons, C. Palmer, B. Patkós, D. Pálvölgyi: Polychromatic colorings of arbitrary rectangular partitions, Discrete Mathematics, 310(1), Elsevier (2010), 21-30. pdf D. Gerbner, B. Keszegh, N. Lemons, C. Palmer, B. Patkós, D. Pálvölgyi: Saturating Sperner families, Graphs and Combinatorics, (2012) doi: 10.1007/s00373-012-1195-6 arXiv P.L. Erdős, D. Gerbner, D. Mubayi, N. Lemons, B. Patkós, C. Palmer: Two-part set systems, Electronic Journal of Combinatorics 19 (2012) P52, pdf D. Gerbner, B. Keszegh, C. Palmer: Generalizations of the Tree Packing Conjecture, Discussiones Mathematicae Graph Theory 32 (2012) 569-583. arXiv D. Gerbner, N. Lemons, C. Palmer, D. Pálvölgyi, B. Patkós, V. Szécsi:Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets, Graphs and Combinatorics, Graphs and Combinatorics (2012) doi: 10.1007/s00373-012-1138-2, pdf D. Gerbner, G.O.H. Katona, D. Pálvölgyi, B. Patkós: Majority and Plurality Problems, Discrete Applied Mathematics, (2012) doi: 10.1016/j.dam.2012.10.023, pdf D. Gerbner, B. Keszegh: Path-search in a pyramid and in other graphs, Journal of Statistical Theory and Practice 6 (2012) 303-314, arXiv D. Gerbner, B. Keszegh, D. Pálvölgyi, G. Wiener: Density-based group testing, LNCS Volume in Memory D. Gerbner: Profile polytopes of some classes of families, Combinatorica, to appear, pdf J. Balogh, J. Barát, D. Gerbner, A. Gyárfás, G. Sárközy: Partitioning edge-2-colored graphs by monochromatic paths and cycles, Combinatorica, to appear, pdf D. Gerbner: The Magnus-Derek game in groups, submitted, pdf D. Gerbner, G. Tóth: Separating families of convex sets, submitted, arXiv A. Dumitrescu, D. Gerbner, B. Keszegh, Cs. Tóth: Covering paths for planar point sets, submitted, arXiv D. Gerbner, V. Mészáros, D. Pálvölgyi, A. Pokrovskiy, G. Rote: Advantage in the discrete Voronoi game, submitted, arXiv Z. Füredi, D. Gerbner, M. Vizer: An analogue of the Erdős-Ko-Rado theorem for multisets, arXiv |
|
|