Máté Vizer

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 59

Top Topics

Combinatorial Search

Doubly Stochastic

Top Venues

Discret. Appl. Math.

Electron. J. Comb.

Publications

Balázs Patkós, Zsolt Tuza, Máté Vizer
Extremal Graph Theoretic Questions for q-Ary Vectors. Graphs Comb. 40 (3) (2024)
Gábor Bacsó, Balázs Patkós, Zsolt Tuza, Máté Vizer
The Robust Chromatic Number of Graphs. Graphs Comb. 40 (4) (2024)
Balázs Patkós, Milos Stojakovic, Jelena Stratijev, Máté Vizer
Generalized saturation game. CoRR (2024)
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 (2024)
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 (2024)
Balázs Patkós, Zsolt Tuza, Máté Vizer
Vector sum-intersection theorems. Discret. Math. 346 (10) (2023)
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Gábor Tardos, Máté Vizer
Turán problems for edge-ordered graphs. J. Comb. Theory, Ser. B 160 (2023)
Dániel Gerbner, Dániel Lenger, Máté Vizer
A plurality problem with three colors and query size three. Discret. Math. 346 (1) (2023)
Péter Pál Pach, Máté Vizer
Improved Lower Bounds for Multiplicative Square-Free Sequences. Electron. J. Comb. 30 (4) (2023)
Dániel Gerbner, Balázs Keszegh, Dániel Lenger, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener
copies of a subgraph, and a related problem in search theory. Discret. Appl. Math. 341 (2023)
Dániel Gerbner, Zoltán Lóránt Nagy, Máté Vizer
Unified approach to the generalized Turán problem and supersaturation. Discret. Math. 345 (3) (2022)
Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer
Rainbow Ramsey Problems for the Boolean Lattice. Order 39 (3) (2022)
Martin Balko, Máté Vizer
On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs. SIAM J. Discret. Math. 36 (1) (2022)
Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer
On saturation of Berge hypergraphs. Eur. J. Comb. 102 (2022)
Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer
Forbidden subposet problems in the grid. Discret. Math. 345 (3) (2022)
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) (2022)
Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer
Saturation problems with regularity constraints. Discret. Math. 345 (8) (2022)
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. Discret. Appl. Math. 288 (2021)
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) (2021)
Dániel Gerbner, Máté Vizer
On non-adaptive majority problems of large query size. Discret. Math. Theor. Comput. Sci. 23 (3) (2021)
Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer
On the maximum number of copies of H in graphs with given size and order. J. Graph Theory 96 (1) (2021)
Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Tilen Marc, Balázs Patkós, Zsolt Tuza, Máté Vizer
On Grundy total domination number in product graphs. Discuss. Math. Graph Theory 41 (1) (2021)
Máté Vizer, Dániel Gerbner
Smart elements in combinatorial group testing problems with more defectives. Art Discret. Appl. Math. 3 (2) (2020)
Dániel Gerbner, Ervin Györi, Abhishek Methuku, Máté Vizer
Generalized Turán problems for even cycles. J. Comb. Theory, Ser. B 145 (2020)
Dániel Gerbner, Máté Vizer
Rounds in a combinatorial search problem. Discret. Appl. Math. 276 (2020)
Gyula O. H. Katona, Andrei M. Raigorodskii, Máté Vizer
Preface: 2nd Russian-Hungarian Combinatorial Workshop. Discret. Appl. Math. 276 (2020)
Dániel Gerbner, Abhishek Methuku, Gholam Reza Omidi, Máté Vizer
Ramsey Problems for Berge Hypergraphs. SIAM J. Discret. Math. 34 (1) (2020)
Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer
t-Wise Berge and t-Heavy Hypergraphs. SIAM J. Discret. Math. 34 (3) (2020)
Akbar Davoodi, Dániel Gerbner, Abhishek Methuku, Máté Vizer
On clique coverings of complete multipartite graphs. Discret. Appl. Math. 276 (2020)
Martin Balko, Máté Vizer
Edge-ordered Ramsey numbers. Eur. J. Comb. 87 (2020)
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 (2019)
Dániel Gerbner, Abhishek Methuku, Máté Vizer
Generalized Turán problems for disjoint copies of graphs. Discret. Math. 342 (11) (2019)
Mustazee Rahman, Bálint Virág, Máté Vizer
Geometry of Permutation Limits. Comb. 39 (4) (2019)
Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer
Domination game on uniform hypergraphs. Discret. Appl. Math. 258 (2019)
Dániel Gerbner, Abhishek Methuku, Máté Vizer
. J. Comb. Theory, Ser. B 137 (2019)
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) (2019)
Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Balázs Patkós, Máté Vizer
An improvement on the maximum number of k?dominating independent sets. J. Graph Theory 91 (1) (2019)
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) (2019)
Dániel Gerbner, Máté Vizer
Majority problems of large query size. Discret. Appl. Math. 254 (2019)
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) (2019)
Dániel Gerbner, Máté Vizer
Smart elements in combinatorial group testing problems. J. Comb. Optim. 35 (4) (2018)
Eyal Ackerman, Balázs Keszegh, Máté Vizer
On the size of planarly connected crossing graphs. J. Graph Algorithms Appl. 22 (1) (2018)
Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins, Máté Vizer
On the maximum size of connected hypergraphs without a path of given length. Discret. Math. 341 (9) (2018)
Dániel Gerbner, Balázs Keszegh, Gábor Mészáros, Balázs Patkós, Máté Vizer
Line Percolation in Finite Projective Planes. SIAM J. Discret. Math. 32 (2) (2018)
Dániel Gerbner, Balázs Patkós, Máté Vizer
Forbidden Subposet Problems for Traces of Set Families. Electron. J. Comb. 25 (3) (2018)
Ervin Györi, Dániel Korándi, Abhishek Methuku, István Tomon, Casey Tompkins, Máté Vizer
On the Turán number of some ordered even cycles. Eur. J. Comb. 73 (2018)
Á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) (2018)
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener
Finding a non-minority ball with majority answers. Discret. Appl. Math. 219 (2017)
Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer
The minimum number of vertices in uniform hypergraphs with given domination number. Discret. Math. 340 (11) (2017)
Dániel Gerbner, Máté Vizer
Conscious and controlling elements in combinatorial group testing problems with more defectives. CoRR (2017)
Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Balázs Patkós, Zsolt Tuza, Máté Vizer
Grundy dominating sequences and zero forcing sets. Discret. Optim. 26 (2017)
Dániel Gerbner, Dániel Lenger, Máté Vizer
A plurality problem with three colors and query size three. CoRR (2017)
Dániel Gerbner, Máté Vizer
Conscious and controlling elements in combinatorial group testing problems. CoRR (2017)
Eyal Ackerman, Balázs Keszegh, Máté Vizer
Coloring Points with Respect to Squares. Discret. Comput. Geom. 58 (4) (2017)
Eyal Ackerman, Balázs Keszegh, Máté Vizer
Coloring Points with Respect to Squares. SoCG (2016)
Kristóf Bérczi, Attila Bernáth, Máté Vizer
A Note on $\mathtt{V}$-free 2-matchings. Electron. J. Comb. 23 (4) (2016)
Eyal Ackerman, Balázs Keszegh, Máté Vizer
On the Size of Planarly Connected Crossing Graphs. Graph Drawing (2016)
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) (2016)
Dániel Gerbner, Máté Vizer
A note on tilted Sperner families with patterns. Discret. Math. 339 (11) (2016)
Kristóf Bérczi, Attila Bernáth, Máté Vizer
A note on $\mathtt{V}$-free $2$-matchings. CoRR (2015)
Zoltán Füredi, Dániel Gerbner, Máté Vizer
A discrete isodiametric result: The Erdős-Ko-Rado theorem for multisets. Eur. J. Comb. 48 (2015)
Eyal Ackerman, Balázs Keszegh, Máté Vizer
On the size of planarly connected crossing graphs. CoRR (2015)
Máté Vizer, Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener
Finding a majority ball with majority answers. Electron. Notes Discret. Math. 49 (2015)
Kristóf Bérczi, Attila Bernáth, Máté Vizer
Regular graphs are antimagic. CoRR (2015)
Younjin Kim, Mohit Kumbhat, Zoltán Lóránt Nagy, Balázs Patkós, Alexey Pokrovskiy, Máté Vizer
Identifying codes and searching with balls in graphs. Discret. Appl. Math. 193 (2015)
Kristóf Bérczi, Attila Bernáth, Máté Vizer
Regular Graphs are Antimagic. Electron. J. Comb. 22 (3) (2015)
Zoltán Lóránt Nagy, Lale Özkahya, Balázs Patkós, Máté Vizer
On the ratio of maximum and minimum degree in maximal intersecting families. Discret. Math. 313 (2) (2013)
Asaf Ferber, Roman Glebov, Michael Krivelevich, Hong Liu, Cory Palmer, Tomás Valla, Máté Vizer
The Biased Odd Cycle Game. Electron. J. Comb. 20 (2) (2013)