default search action
Máté Vizer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j58]Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Some exact results for regular Turán problems for all large orders. Eur. J. Comb. 117: 103828 (2024) - [j57]Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Nika Salia
, Máté Vizer:
Stability of extremal connected hypergraphs avoiding Berge-paths. Eur. J. Comb. 118: 103930 (2024) - [j56]Balázs Patkós, Zsolt Tuza, Máté Vizer:
Extremal Graph Theoretic Questions for q-Ary Vectors. Graphs Comb. 40(3): 57 (2024) - [j55]Gábor Bacsó, Balázs Patkós
The Robust Chromatic Number of Graphs. Graphs Comb. 40(4): 89 (2024) - [i8]Balázs Patkós, Milos Stojakovic, Jelena Stratijev, Máté Vizer:
Generalized saturation game. CoRR abs/2404.02288 (2024) - 2023
- [j54]Péter Pál Pach, Máté Vizer:
Improved Lower Bounds for Multiplicative Square-Free Sequences. Electron. J. Comb. 30(4) (2023) - [j53]Dániel Gerbner, Balázs Keszegh, Dániel Lenger, Dániel T. Nagy
On graphs that contain exactly k copies of a subgraph, and a related problem in search theory. Discret. Appl. Math. 341: 196-203 (2023) - [j52]Dániel Gerbner, Dániel Lenger, Máté Vizer:
A plurality problem with three colors and query size three. Discret. Math. 346(1): 113151 (2023) - [j51]Balázs Patkós, Zsolt Tuza, Máté Vizer:
Vector sum-intersection theorems. Discret. Math. 346(10): 113506 (2023) - [j50]Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy
Turán problems for edge-ordered graphs. J. Comb. Theory B 160: 66-113 (2023) - 2022
- [j49]Dániel Gerbner
Forbidden subposet problems in the grid. Discret. Math. 345(3): 112720 (2022) - [j48]Dániel Gerbner, Zoltán Lóránt Nagy
Unified approach to the generalized Turán problem and supersaturation. Discret. Math. 345(3): 112743 (2022) - [j47]Dániel Gerbner
Saturation problems with regularity constraints. Discret. Math. 345(8): 112921 (2022) - [j46]Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Singular Turán numbers and WORM-colorings. Discuss. Math. Graph Theory 42(4): 1061-1074 (2022) - [j45]Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
On saturation of Berge hypergraphs. Eur. J. Comb. 102: 103477 (2022) - [j44]Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li
Rainbow Ramsey Problems for the Boolean Lattice. Order 39(3): 453-463 (2022) - [j43]Martin Balko
On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs. SIAM J. Discret. Math. 36(1): 214-228 (2022) - 2021
- [j42]Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
Supersaturation, Counting, and Randomness in Forbidden Subposet Problems. Electron. J. Comb. 28(1): 1 (2021) - [j41]Gábor Damásdi
Adaptive majority problems for restricted query graphs and for weighted sets. Discret. Appl. Math. 288: 235-245 (2021) - [j40]Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Tilen Marc
On Grundy total domination number in product graphs. Discuss. Math. Graph Theory 41(1): 225-247 (2021) - [j39]Dániel Gerbner, Máté Vizer:
On non-adaptive majority problems of large query size. Discret. Math. Theor. Comput. Sci. 23(3) (2021) - [j38]Dániel Gerbner
On the maximum number of copies of H in graphs with given size and order. J. Graph Theory 96(1): 34-43 (2021) - 2020
- [j37]Máté Vizer, Dániel Gerbner:
Smart elements in combinatorial group testing problems with more defectives. Art Discret. Appl. Math. 3(2) (2020) - [j36]Gyula O. H. Katona, Andrei M. Raigorodskii, Máté Vizer:
Preface: 2nd Russian-Hungarian Combinatorial Workshop. Discret. Appl. Math. 276: 1 (2020) - [j35]Akbar Davoodi
On clique coverings of complete multipartite graphs. Discret. Appl. Math. 276: 19-23 (2020) - [j34]Dániel Gerbner
Rounds in a combinatorial search problem. Discret. Appl. Math. 276: 60-68 (2020) - [j33]Martin Balko
Edge-ordered Ramsey numbers. Eur. J. Comb. 87: 103100 (2020) - [j32]Dániel Gerbner, Ervin Györi, Abhishek Methuku
Generalized Turán problems for even cycles. J. Comb. Theory B 145: 169-213 (2020) - [j31]Dániel Gerbner, Abhishek Methuku, Gholam Reza Omidi, Máté Vizer:
Ramsey Problems for Berge Hypergraphs. SIAM J. Discret. Math. 34(1): 351-369 (2020) - [j30]Dániel Gerbner, Dániel T. Nagy
t-Wise Berge and t-Heavy Hypergraphs. SIAM J. Discret. Math. 34(3): 1813-1829 (2020)
2010 – 2019
- 2019
- [j29]Mustazee Rahman
Geometry of Permutation Limits. Comb. 39(4): 933-960 (2019) - [j28]Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
Stability Results for Vertex Turán Problems in Kneser Graphs. Electron. J. Comb. 26(2): 2 (2019) - [j27]Dániel Gerbner
Majority problems of large query size. Discret. Appl. Math. 254: 124-134 (2019) - [j26]Csilla Bujtás
Domination game on uniform hypergraphs. Discret. Appl. Math. 258: 65-75 (2019) - [j25]Dániel Gerbner, Abhishek Methuku, Máté Vizer:
Generalized Turán problems for disjoint copies of graphs. Discret. Math. 342(11): 3130-3141 (2019) - [j24]Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
On the Number of Containments in P-free Families. Graphs Comb. 35(6): 1519-1540 (2019) - [j23]Dániel Gerbner
Asymptotics for the Turán number of Berge-K2, t. J. Comb. Theory B 137: 264-290 (2019) - [j22]Dániel Gerbner
An improvement on the maximum number of k?dominating independent sets. J. Graph Theory 91(1): 88-97 (2019) - [j21]Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
Forbidding Rank-Preserving Copies of a Poset. Order 36(3): 611-620 (2019) - [i7]Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets. CoRR abs/1903.08383 (2019) - 2018
- [j20]Dániel Gerbner, Balázs Patkós, Máté Vizer:
Forbidden Subposet Problems for Traces of Set Families. Electron. J. Comb. 25(3): 3 (2018) - [j19]Ágnes Backhausz, Balázs Gerencsér, Viktor Harangi, Máté Vizer:
Correlation Bounds for Distant Parts of Factor of IID Processes. Comb. Probab. Comput. 27(1): 1-20 (2018) - [j18]Ervin Györi, Abhishek Methuku, Nika Salia
On the maximum size of connected hypergraphs without a path of given length. Discret. Math. 341(9): 2602-2605 (2018) - [j17]Ervin Györi, Dániel Korándi
On the Turán number of some ordered even cycles. Eur. J. Comb. 73: 81-88 (2018) - [j16]Dániel Gerbner
Smart elements in combinatorial group testing problems. J. Comb. Optim. 35(4): 1042-1060 (2018) - [j15]Eyal Ackerman, Balázs Keszegh, Máté Vizer:
On the size of planarly connected crossing graphs. J. Graph Algorithms Appl. 22(1): 11-22 (2018) - [j14]Dániel Gerbner
Line Percolation in Finite Projective Planes. SIAM J. Discret. Math. 32(2): 864-881 (2018) - 2017
- [j13]Dániel Gerbner
Finding a non-minority ball with majority answers. Discret. Appl. Math. 219: 18-31 (2017) - [j12]Eyal Ackerman, Balázs Keszegh
Coloring Points with Respect to Squares. Discret. Comput. Geom. 58(4): 757-784 (2017) - [j11]Bostjan Bresar, Csilla Bujtás
Grundy dominating sequences and zero forcing sets. Discret. Optim. 26: 66-77 (2017) - [j10]Csilla Bujtás
The minimum number of vertices in uniform hypergraphs with given domination number. Discret. Math. 340(11): 2704-2713 (2017) - [i6]Dániel Gerbner, Máté Vizer:
Conscious and controlling elements in combinatorial group testing problems. CoRR abs/1703.05398 (2017) - [i5]Dániel Gerbner, Máté Vizer:
Conscious and controlling elements in combinatorial group testing problems with more defectives. CoRR abs/1705.08539 (2017) - [i4]Dániel Gerbner, Dániel Lenger, Máté Vizer:
A plurality problem with three colors and query size three. CoRR abs/1708.05864 (2017) - 2016
- [j9]Kristóf Bérczi, Attila Bernáth, Máté Vizer:
A Note on $\mathtt{V}$-free 2-matchings. Electron. J. Comb. 23(4): 4 (2016) - [j8]Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Dominating Sequences in Grid-Like and Toroidal Graphs. Electron. J. Comb. 23(4): 4 (2016) - [j7]Dániel Gerbner
A note on tilted Sperner families with patterns. Discret. Math. 339(11): 2737-2741 (2016) - [c2]Eyal Ackerman, Balázs Keszegh, Máté Vizer:
Coloring Points with Respect to Squares. SoCG 2016: 5:1-5:16 - [c1]Eyal Ackerman, Balázs Keszegh, Máté Vizer:
On the Size of Planarly Connected Crossing Graphs. GD 2016: 311-320 - 2015
- [j6]Kristóf Bérczi, Attila Bernáth, Máté Vizer:
Regular Graphs are Antimagic. Electron. J. Comb. 22(3): 3 (2015) - [j5]Younjin Kim, Mohit Kumbhat, Zoltán Lóránt Nagy
Identifying codes and searching with balls in graphs. Discret. Appl. Math. 193: 39-47 (2015) - [j4]Zoltán Füredi, Dániel Gerbner
A discrete isodiametric result: The Erdős-Ko-Rado theorem for multisets. Eur. J. Comb. 48: 224-233 (2015) - [j3]Máté Vizer, Dániel Gerbner
Finding a majority ball with majority answers. Electron. Notes Discret. Math. 49: 345-351 (2015) - [i3]Kristóf Bérczi, Attila Bernáth, Máté Vizer:
Regular graphs are antimagic. CoRR abs/1504.08146 (2015) - [i2]Kristóf Bérczi, Attila Bernáth, Máté Vizer:
A note on $\mathtt{V}$-free $2$-matchings. CoRR abs/1505.03717 (2015) - [i1]Eyal Ackerman, Balázs Keszegh, Máté Vizer:
On the size of planarly connected crossing graphs. CoRR abs/1509.02475 (2015) - 2013
- [j2]Asaf Ferber, Roman Glebov, Michael Krivelevich, Hong Liu, Cory Palmer
The Biased Odd Cycle Game. Electron. J. Comb. 20(2): 9 (2013) - [j1]Zoltán Lóránt Nagy
On the ratio of maximum and minimum degree in maximal intersecting families. Discret. Math. 313(2): 207-211 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: