Book

Papers

◼ 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) 988-995, 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, N. Lemons, C. Palmer, B. Patkós, V. Szécsi: Cross-Sperner families, Studia Sci. Math. Hungarica 49 (2012) 44-51., 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, 10 pages, arXiv

◼ 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. Palmer, B. Patkós, V. Szécsi: Almost intersecting families of sets, SIAM J. Discrete Math. 26 (2012) 1657-1669., pdf

◼ 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 29 (2013) 489-498 , pdf

◼ D. Gerbner, B. Keszegh, N. Lemons, C. Palmer, D. Pálvölgyi, B. Patkós: Saturating Sperner families, Graphs and Combinatorics 29 (2013) 1355-1364, arXiv

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

◼ 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

◼ D. Gerbner: The Magnus-Derek game in groups, Discrete Mathematics and Theoretical Computer Science 15 (2013) 119-126, 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 34 (2014) 507-526, pdf

◼ J. Barát, D. Gerbner: Edge-decomposition of graphs into copies of a tree with four edges, Electronic J. of Combinatorics 21 (2014) paper 1.55, 11 pages, arXiv

◼ A. Dumitrescu, D. Gerbner, B. Keszegh, Cs. Tóth: Covering paths for planar point sets, Discrete & Computational Geometry 51 (2014) 462-484; Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications Proceedings , arXiv

◼ D. Gerbner, V. Mészáros, D. Pálvölgyi, A. Pokrovskiy, G. Rote: Advantage in the discrete Voronoi game, J. Graphs Algorithms Appl. 18 (2014) 439-457, arXiv

◼ Z. Füredi, D. Gerbner, M. Vizer: A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets, European J. Combin. 48 (2015) 224-233, arXiv

◼ D. Gerbner, B. Keszegh, D. Pálvölgyi, B. Patkós, M. Vizer, G. Wiener: Finding a non-minority ball with majority answers, Discrete Applied Mathematics 219(11) (2017) 18-31.; Proceedings of Eurocomb 2015, Electr. Notes in Disc. Math. 49 (2015) 345-351, arXiv

◼ D. Gerbner, B. Keszegh, D. Pálvölgyi, G. Rote, G. Wiener: Search for the end of a path in the d-dimensional grid and in other graphs, Ars Math. Contemporanea 12(2) (2017) 301-314, arXiv

◼ D. Gerbner, A. Methuku, C. Tompkins: Intersecting P-free families, Journal of Combinatorial Theory, Series A, 151 (2017) 61-83, arXiv

◼ D. Gerbner, C. Palmer: Extremal results for Berge-hypergraphs, SIAM J. Disc. Math, 31(4) (2017) 2314-2327, arXiv

◼ F. Benevides, D. Gerbner, C. Palmer, D. Vu: Identifying defective sets using queries of small size, Discrete Mathematics, 341(1) (2018) 143-150, arXiv

◼ D. Gerbner, B. Keszegh, C. Palmer, B. Patkós: On the number of cycles in graphs with restricted cycle lengths, SIAM J. Disc. Math, 32(1) (2018) 266-279, arXiv

◼ D. Gerbner, B. Keszegh, G. Mészáros, B. Patkós, M. Vizer: Line Percolation in Finite Projective Planes, SIAM J. Disc. Math, 32(2) (2018) 864-881, arXiv

◼ D. Gerbner, M. Vizer: Smart elements in combinatorial group testing problems, Journal of Comb. Opt 35(4) (2018) 1046-1060, arXiv

◼ D. Gerbner, B. Patkós, M. Vizer: Forbidden subposet problems for traces of set families, Electronic J. of Combinatorics,Volume 25, Issue 3 (2018), Paper #P3.49, 17 pages, arXiv

◼ D. Gerbner, M. Vizer: Majority problems of large query size, Disc. Appl. Math 254 (2019), 124-134, arXiv

◼ S. English, D. Gerbner, A. Methuku, M. Tait: Linearity of Saturation for Berge Hypergraphs, European Journal of Combinatorics 78 (2019), 205-213, arXiv

◼ D. Gerbner, A. Methuku, M. Vizer: Asymptotics for the Turán number of Berge-K_{2,t}, JCTB, 137 (2019) 264-290, arXiv

◼ D. Gerbner, B. Keszegh, A. Methuku, B. Patkós, M. Vizer: An improvement on the maximum number of k-dominating independent sets, Journal of Graph Theory, 91(1) (2019) 88-97, arXiv

◼ D. Gerbner, A. Methuku, D.T. Nagy, B. Patkós, M. Vizer: Stability results on vertex Turán problems in Kneser graphs, Electronic Journal of Combinatorics, 26(2) (2019) Paper #P2.13, arXiv

◼ D. Gerbner, A. Methuku, M. Vizer: Generalized Turán problems for disjoint copies of a graph, Discrete Mathematics 342(11) (2019) 3130-3141, arXiv

◼ D. Gerbner, A. Methuku, D.T. Nagy, B. Patkós, M. Vizer: On the number of containments in P-free families, Graphs and Combinatorics 35(6) (2019) 1519-1540, arXiv

◼ D. Gerbner, C. Palmer: Counting copies of a fixed subgraph of F-free graphs, European Journal of Mathematics 82 (2019) 103001, arXiv

◼ S. English, D. Gerbner, A. Methuku, C. Palmer: On the weight of Berge-F-free hypergraphs, Electronic Journal of Combinatorics, 26(4) (2019) Paper #P4.7, arXiv

◼ D. Gerbner, A. Methuku, D.T. Nagy, B. Patkós, M. Vizer: Forbidding rank-preserving copies of a poset, Order 36(3) (2019) 611-620, arXiv

◼ D. Gerbner, A. Methuku, C. Palmer: General lemmas for Berge-Turán hypergraph problems, European Journal of Combinatorics, 86 (2020) 103082, arXiv

◼ A. Davoodi, D. Gerbner, A. Methuku, M. Vizer: On Clique Coverings of Complete Multipartite Graphs, Discrete Applied Mathematics, 276 (2020) 19-23, arXiv

◼ D. Gerbner, M. Vizer: Rounds in a combinatorial search problem, Discrete Applied Mathematics, 276 (2020) 60-68, arXiv

◼ D. Gerbner, E. Győri, A. Methuku, M. Vizer: Generalized Turán problems for even cycles, JCTB, 145 (2020) 169-213, arXiv

◼ D. Gerbner, A. Methuku, G.Omidi, M. Vizer: Ramsey problems for Berge hypergraphs, SIDMA 34(1) (2020) 351-369, arXiv

◼ H. Chang, D. Gerbner, B. Patkós: Finding non-minority balls with majority and plurality queries, Discrete Applied Mathematics, 284(30) (2020) 631-639, arXiv

◼ D. Gerbner: On Berge-Ramsey problems, The Electronic Journal of Combinatorics, 27(2) 2020 Paper #2.39. arXiv

◼ D. Gerbner, B. Keszegh, A. Methuku, D.T. Nagy, B. Patkós, C. Tompkins, C. Xiao: Set systems related to a house allocation problem, Discrete Mathematics, 343 (2020) 111886, arXiv

◼ D. Gerbner, B. Keszegh, B. Patkós: Generalized forbidden subposet problems, Order, 37 (2020), 389-410, arXiv

◼ D. Gerbner, M. Vizer: Smart elements in combinatorial group testing problems with more defectives, The Art of Discrete and Applied Mathematics, 3(2) (2020) P2.05, arXiv

◼ D. Gerbner, D.T. Nagy, B. Patkós, M. Vizer: t-wise Berge and t-heavy hypergraphs, SIDMA, 34(3) (2020), 1813-1829, arXiv

◼ D. Gerbner, D.T. Nagy, B. Patkós, M. Vizer: On the maximum number of copies of H in graphs with given size and order, Journal of Graph Theory, 96(1), Special Issue: Ron Graham, (2021) 34-43, arXiv

◼ D. Gerbner: A note on the Turán number of a Berge odd cycle, Australasian Journal of Combinatorics, 79(2) (2021), 205–214, arXiv

◼ G. Damásdi, D. Gerbner, G. O. H. Katona, B. Keszegh, D. Lenger, A. Methuku, D.T. Nagy, D. Pálvölgyi, B. Patkós, M. Vizer, G. Wiener: Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets, Discrete Applied Mathematics, 288 (2021), 235-245, arXiv

◼ D. Gerbner, D.T. Nagy, B. Patkós, M. Vizer: Supersaturation, counting, and randomness in forbidden subposet problems, Electronic Journal of Combinatorics, 28(1) (2021), P1.40, arXiv

◼ D. Gerbner: On Turán-good graphs, Discrete Mathematics 344(8) (2021), 112445, arXiv

◼ D. Gerbner: A note on stability for maximal F-free graphs, Graphs and Combinatorics, 37 (2021), 2571-2580, arXiv

◼ D. Gerbner, M. Vizer: On non-adaptive majority problems of large query size, Discrete Mathematics and Theoretical Computer Science 23:3, 2021, #15 arXiv

◼ D. Gerbner, A. Methuku, D.T. Nagy, B. Patkós, M. Vizer: Vertex Turán problems for the oriented hypercube, Acta Univ. Sapientiae Math., 13(2) (2021) 356--366, arXiv

◼ Z. Füredi, D. Gerbner: Hypergraphs without exponents, JCTA, 184, 2021, 105517, arXiv

◼ D. Gerbner, B. Patkós, Zs. Tuza, M. Vizer: On saturation of Berge hypergraphs, European Journal of Combinatorics 102 (2022), 103477, arXiv

◼ D. Gerbner, D.T. Nagy, B. Patkós, M. Vizer: Forbidden subposet problems in the grid, Discrete Mathematics 345(3) (2022), 112720, arXiv

◼ D. Gerbner, Z.L. Nagy, M. Vizer: Unified approach to the generalized Turán problem and supersaturation, Discrete Mathematics, 345(3), (2022), 112743, arXiv

◼ D. Gerbner, B. Patkós, Zs. Tuza, M. Vizer: Singular Turán numbers and WORM-colorings, DMGT 42(4), (2022) 1061-1074, arXiv

◼ D. Gerbner: A note on the uniformity threshold for Berge hypergraphs, European Journal of Combinatorics, 105, (2022), 103561 arXiv

◼ D. Gerbner: A note on the number of triangles in graphs without the suspension of a path on four vertices, Discrete Math. Lett. 10 (2022) 32-34, arXiv

◼ D. Gerbner, B. Patkós, Zs. Tuza, M. Vizer: Saturation problems with regularity constraints, Discrete Mathematics 345(8), 2022, 112921, arXiv

◼ F-H. Chang, D. Gerbner, W-T. Li, A. Methuku, D.T. Nagy, B. Patkós, M. Vizer: Rainbow Ramsey problems for the Boolean lattice, Order, 39, (2022), 453–463, arXiv

◼ M. Balko, D. Gerbner, D.Y. Kang, Y. Kim, C. Palmer: Hypergraph based Berge hypergraphs, Graphs and Combinatorics, 38 (2022), 11, arXiv

◼ D. Gerbner, T. Mészáros, A. Methuku, C. Palmer: Generalized rainbow Turán problems, Electronic J. Comb., 29(2), (2022), P2.44, arXiv

◼ D. Gerbner, B. Patkós: Generalized Turán problems for complete bipartite graphs, Graphs and Combinatorics 38 (2022) 164, arXiv

◼ D. Gerbner, C. Palmer: Some exact results for generalized Turán problems, European Journal of Combinatorics, 103, 103519, 2022, arXiv

◼ D. Gerbner: Generalized Turán problems for small graphs, DMGT, 43(2) (2023) 549-572, arXiv

◼ D. Gerbner, A. Methuku, D.T. Nagy, D. Pálvölgyi, G. Tardos, M. Vizer: Turán problems for Edge-ordered graphs, JCTB 160, (2023), 66-113, arXiv

◼ D. Gerbner, D. Lenger, M. Vizer: A plurality problem with three colors and query size three, Discrete Mathematics 346, (2023), 113151 arXiv

◼ D. Gerbner: Generalized Turán problems for K_{2,t}, Electronic J. Comb, 30(1), 2023, P1.34, arXiv

◼ D. Gerbner: Generalized Turán problems for double stars, Discrete Mathematics, 346(7), (2023), 113395 arXiv

◼ D. Gerbner: Some stability and exact results in generalized Turán problems, STUDIA SCI. MATH. HUNGARICA, 60(1), (2023), 16-26, arXiv

◼ D. Gerbner: Paths are Turán-good, Graphs and Combinatorics, 39, (2023), 56, arXiv

◼ D. Gerbner, B. Keszegh, D. Lenger, D.T. Nagy, D. Pálvölgyi, B. Patkós, M. Vizer, G. Wiener: On graphs that contain exactly k copies of a subgraph, and a related problem in search theory, Discrete Applied Mathematics, 341, (2023), 196-203, arXiv

◼ D. Gerbner: The profile polytope of non-trivial intersecting families, SIDMA, 37(4), (2023) 2265-2275, arXiv

◼ X. Zhu, Y. Chen, D. Gerbner, E. Győri, H. Hama Karim: The maximum number of triangles in F_k-free graphs, European Journal of Combinatorics, 114, (2023) 103793, arXiv

◼ D. Gerbner: Some exact results for non-degenerate generalized Turán problems, Electronic J. Comb., 30(4) (2023), P4.39 arXiv

◼ D. Gerbner: The covering lemma and q-analogues of extremal set theory problems, Ars Math. Contemp., 24 (2024), #1.07, arXiv

◼ D. Gerbner, B. Patkós: Generalized Turán results for intersecting cliques, Discrete Mathematics, 347(1), 2024, 113710, arXiv

◼ D. Gerbner, B. Patkós, Zs. Tuza, M. Vizer: Some exact results for regular Turán problems for all large orders, European Journal of Combinatorics, 117, 2024, 103828, arXiv

◼ D. Gerbner: A non-aligning variant of generalized Turán problems, Annals of Combinatorics, 2023, arXiv

◼ D. Gerbner: On Turán problems with bounded matching number, Journal of Graph Theory, 106(1) (2024) 23-29, arXiv

◼ D. Gerbner, D.T. Nagy, B. Patkós, N. Salia, M. Vizer: Stability of extremal connected hypergraphs avoiding Berge-paths, European Journal of Combinatorics, 118, 2024, 103930 arXiv

◼ D. Gerbner: On the extremal graphs in generalized Turán problems, Discrete Mathematics, 347(6), 2024, 114021, arXiv

◼ D. Gerbner: Generalized Turán results for disjoint cliques, Discrete Mathematics,347(7), 2024, 114024 arXiv

◼ D. Gerbner: On weakly Turán-good graphs, DMGT, available online, arXiv

◼ J. Barát, D. Gerbner, A. Halfpap: On the number of A-transversals in hypergraphs, Periodica Mathematica Hungarica, accepted, arXiv

◼ D. Gerbner: On non-degenerate Berge-Turán problems, Graphs and Combinatorics, accepted, arXiv

◼ D. Gerbner: Between the deterministic and non-deterministic query complexity, arXiv

◼ D. Gerbner: Counting multiple graphs in generalized Turán problems, arXiv

◼ D. Gerbner: The Turán number of Berge book hypergraphs, arXiv

◼ D. Gerbner: Rainbow copies of F in families of H, arXiv

◼ D. Gerbner: A note on strongly and totally chain intersecting families, arXiv

◼ D. Gerbner, H. Hama Karim: Stability from graph symmetrization arguments in generalized Turán problems, arXiv

◼ D. Gerbner, B. Keszegh, K. Nagy, B. Patkós, G. Wiener: Cooperation in Combinatorial Search, arXiv

◼ D. Gerbner: On non-degenerate Turán problems for expansions, arXiv

◼ D. Gerbner: On generalized Turán problems with bounded matching number, arXiv

◼ D. Gerbner, B. Keszegh, D.T. Nagy, K. Nagy, D. Pálvölgyi, B. Patkós, G. Wiener: Query complexity of Boolean functions on the middle slice of the cube, arXiv

◼ D. Gerbner: On forbidding graphs as traces of hypergraphs, arXiv

◼ D. Gerbner, H. Hama Karim, Generalized regular Turán numbers, arXiv

◼ D. Gerbner: On degree powers and counting stars in F-free graphs, arXiv

◼ D. Gerbner: Degree powers and number of stars in graphs with a forbidden broom, arXiv

◼ D. Gerbner, A. Grzesik, C. Palmer, M. Prorok: Directed graphs without rainbow stars, arXiv

◼ D. Gerbner, B. Patkós: A note on vertex Turán problems in the Kneser cube, arXiv

◼ D. Gerbner: On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph, arXiv