Zobrazeno 1 - 10
of 92
pro vyhledávání: '"Dániel Gerbner"'
Autor:
Dániel Gerbner
Publikováno v:
Discrete Mathematics Letters, Vol 8, Pp 44-49 (2024)
Externí odkaz:
https://doaj.org/article/6d0e916c6f3444c497425c6b609ae017
Autor:
Dániel Gerbner
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 44, Iss 4, p 1539 (2024)
Externí odkaz:
https://doaj.org/article/8888e8b403694b7d9f2cf8f678995263
Autor:
Dániel Gerbner
Publikováno v:
Discrete Mathematics Letters, Vol 10, Pp 32-34 (2022)
Externí odkaz:
https://doaj.org/article/1ac6fa58a2894f98bca1546e510b07e8
Autor:
Dániel Gerbner
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 43, Iss 2, p 549 (2023)
Externí odkaz:
https://doaj.org/article/865ba3d194d3460f8b85e4985058fe25
Autor:
Dániel Gerbner, Máté Vizer
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 23, no. 3, Iss Analysis of Algorithms (2021)
We are given $n$ balls and an unknown coloring of them with two colors. Our goal is to find a ball that belongs to the larger color class, or show that the color classes have the same size. We can ask sets of $k$ balls as queries, and the problem has
Externí odkaz:
https://doaj.org/article/ae9e099acf7e4aef8e3a8eeaa5046417
Autor:
Dániel Gerbner
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 15 no. 3, Iss Combinatorics (2013)
Combinatorics
Externí odkaz:
https://doaj.org/article/93fac0fdb4444a99997e389cd4b3ad30
Autor:
Dániel Gerbner
Publikováno v:
Annals of Combinatorics.
In the so-called generalized Turán problems we study the largest number of copies of H in an n-vertex F-free graph G. Here we introduce a variant, where F is not forbidden, but we restrict how copies of H and F can be placed in G. More precisely, gi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d917cdd583e279961c58aea9b0399f7
https://doi.org/10.1007/s00026-023-00640-8
https://doi.org/10.1007/s00026-023-00640-8
Autor:
Dániel Gerbner
Publikováno v:
The Electronic Journal of Combinatorics. 30
The generalized Turán function $\mathrm{ex}(n,H,F)$ denotes the largest number of copies of $H$ among $F$-free $n$-vertex graphs. We study $\mathrm{ex}(n,H,F)$ when $H$ or $F$ is $K_{2,t}$. We determine the order of magnitude of $\mathrm{ex}(n,H,K_{
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9308e964ab95390bb78b7a9d228655a3
https://doi.org/10.37236/10588
https://doi.org/10.37236/10588
Autor:
Dániel Gerbner
Publikováno v:
Discrete Mathematics. 346:113395
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ae6148029f494be4d3f9e547db203f0
https://doi.org/10.1016/j.disc.2023.113395
https://doi.org/10.1016/j.disc.2023.113395
Autor:
Dániel Gerbner, Balázs Patkós
Publikováno v:
Graphs and Combinatorics. 38
For graphs H, F and integer n, the generalized Turán number ex(n, H, F) denotes the maximum number of copies of H that an F-free n-vertex graph can have. We study this parameter when both H and F are complete bipartite graphs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9174318a8aacd62f4dbe092866a91a90
https://doi.org/10.1007/s00373-022-02570-3
https://doi.org/10.1007/s00373-022-02570-3