Dániel Gerbner


 Alfréd Rényi Institute of Mathematics

 Hungarian Academy of Sciences

 H-1053 Budapest, Reáltanoda u. 13-15.


Curriculum Vitae



    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ölgyiB.  Patkós, G. Wiener: Finding the maximum and minimum elements with one lie, Discrete Applied Mathematics 158/9 (2010) 988-995, pdf

    D. Gerbner, B. Keszegh, N. Lemons, C. PalmerB.  Patkós, D. Pálvölgyi: Polychromatic colorings of arbitrary rectangular partitions, 
    Discrete Mathematics, 310(1), Elsevier (2010), 21-30. pdf

        D. Gerbner, N. Lemons, C. PalmerB.  Patkós, V. Szécsi:  Cross-Sperner families, Studia Sci. Math. Hungarica 49 (2012) 44-51. pdf

P.L. Erdős, D. Gerbner, D. MubayiN. LemonsB.  Patkós, C. Palmer: Two-part set systems, Electronic Journal of Combinatorics 19 (2012) P52, 10 pages, pdf

        D. Gerbner, B. Keszegh, C. Palmer: Generalizations of the Tree Packing Conjecture, Discussiones Mathematicae Graph Theory 32 (2012) 569-583. arXiv

    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, N. Lemons, C. PalmerB.  Patkós, V. Szécsi: Almost intersecting families of sets, SIAM J. Discrete Math. 26 (2012) 1657-1699. pdf       

Gerbner, N. Lemons, C. PalmerD. Pálvölgyi, B.  Patkós, V. Szécsi:
        Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets, Graphs and Combinatorics 29 (2013) 489-498, doi: 10.1007/s00373-012-1138-2, pdf

        D. Gerbner, B. Keszegh, N. Lemons, C. PalmerB.  Patkós, D. Pálvölgyi: Saturating Sperner families, Graphs and Combinatorics 29
        (2013) 1355-1364, doi: 10.1007/s00373-012-1195-6, arXiv

    D. Gerbner, G.O.H. Katona, D. PálvölgyiB.  Patkós: Majority and Plurality Problems, Discrete Applied Mathematics 161 (2013) 813-818, pdf

    D. Gerbner, B. Keszegh, D. Pálvölgyi, G. Wiener: Density-based group testing, Information Theory, Combinatorics and Search Theory, in Memory
    of Rudolf Ahlswede,
    LNCS 7777 (2013) 543-556, arXiv

    D. Gerbner: Profile polytopes of some classes of families, Combinatorica 33 (2013) 199-216, pdf

        D. Gerbner, G. Tóth: Separating families of convex sets, Computational Geometry 46 (2013) 1056-1058. arXiv

    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

        J. Barát, D. Gerbner: Edge-decomposition of graphs into copies of a tree with four edges, Electronic J. of Combinatorics, accepted, pdf

        D. Gerbner: The Magnus-Derek game in groups, Discrete Mathematics and Theoretical Computer Science 15 (2013) 119-126, pdf

        A. Dumitrescu, D. Gerbner, 
B. Keszegh, Cs. Tóth: Covering paths for planar point sets, Discrete & Computational Geometry, accepted, 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

D. Gerbner, B. Keszegh, C. Palmer, D. Pálvölgyi: Topological orderings of weighted directed acyclic graphs, submitted, arXiv