The Biased Odd Cycle Game. - Asaf Ferber; Roman Glebov; Michael Krivelevich; Hong Liu 010; Cory Palmer; Tomás Valla; Máté Vizer (Electron. J. Comb., 2013)

On the ratio of maximum and minimum degree in maximal intersecting families. - Zoltán Lóránt Nagy; Lale Özkahya; Balázs Patkós; Máté Vizer (Discret. Math., 2013)

Regular Graphs are Antimagic. - Kristóf Bérczi; Attila Bernáth; Máté Vizer (Electron. J. Comb., 2015)

Identifying codes and searching with balls in graphs. - Younjin Kim; Mohit Kumbhat; Zoltán Lóránt Nagy; Balázs Patkós; Alexey Pokrovskiy; Máté Vizer (Discret. Appl. Math., 2015)

A discrete isodiametric result: The Erdős-Ko-Rado theorem for multisets. - Zoltán Füredi; Dániel Gerbner; Máté Vizer (Eur. J. Comb., 2015)

Finding a majority ball with majority answers. - Máté Vizer; Dániel Gerbner; Balázs Keszegh; Dömötör Pálvölgyi; Balázs Patkós; Gábor Wiener (Electron. Notes Discret. Math., 2015)

A Note on $ mathtt{V}$-free 2-matchings. - Kristóf Bérczi; Attila Bernáth; Máté Vizer (Electron. J. Comb., 2016)

Dominating Sequences in Grid-Like and Toroidal Graphs. - Bostjan Bresar; Csilla Bujtás; Tanja Gologranc; Sandi Klavzar; Gasper Kosmrlj; Balázs Patkós; Zsolt Tuza; Máté Vizer (Electron. J. Comb., 2016)

A note on tilted Sperner families with patterns. - Dániel Gerbner; Máté Vizer (Discret. Math., 2016)

Conscious and controlling elements in combinatorial group testing problems. - Dániel Gerbner; Máté Vizer (CoRR, 2017)

Conscious and controlling elements in combinatorial group testing problems with more defectives. - Dániel Gerbner; Máté Vizer (CoRR, 2017)

Finding a non-minority ball with majority answers. - Dániel Gerbner; Balázs Keszegh; Dömötör Pálvölgyi; Balázs Patkós; Máté Vizer; Gábor Wiener (Discret. Appl. Math., 2017)

Coloring Points with Respect to Squares. - Eyal Ackerman; Balázs Keszegh; Máté Vizer (Discret. Comput. Geom., 2017)

Grundy dominating sequences and zero forcing sets. - Bostjan Bresar; Csilla Bujtás; Tanja Gologranc; Sandi Klavzar; Gasper Kosmrlj; Balázs Patkós; Zsolt Tuza; Máté Vizer (Discret. Optim., 2017)

The minimum number of vertices in uniform hypergraphs with given domination number. - Csilla Bujtás; Balázs Patkós; Zsolt Tuza; Máté Vizer (Discret. Math., 2017)

Forbidden Subposet Problems for Traces of Set Families. - Dániel Gerbner; Balázs Patkós; Máté Vizer (Electron. J. Comb., 2018)

Correlation Bounds for Distant Parts of Factor of IID Processes. - Ágnes Backhausz; Balázs Gerencsér; Viktor Harangi; Máté Vizer (Comb. Probab. Comput., 2018)

On the maximum size of connected hypergraphs without a path of given length. - Ervin Györi; Abhishek Methuku; Nika Salia; Casey Tompkins; Máté Vizer (Discret. Math., 2018)

On the Turán number of some ordered even cycles. - Ervin Györi; Dániel Korándi; Abhishek Methuku; István Tomon; Casey Tompkins; Máté Vizer (Eur. J. Comb., 2018)

Smart elements in combinatorial group testing problems. - Dániel Gerbner; Máté Vizer (J. Comb. Optim., 2018)

On the size of planarly connected crossing graphs. - Eyal Ackerman; Balázs Keszegh; Máté Vizer (J. Graph Algorithms Appl., 2018)

Line Percolation in Finite Projective Planes. - Dániel Gerbner; Balázs Keszegh; Gábor Mészáros; Balázs Patkós; Máté Vizer (SIAM J. Discret. Math., 2018)

Geometry of Permutation Limits. - Mustazee Rahman; Bálint Virág; Máté Vizer (Comb., 2019)

Stability Results for Vertex Turán Problems in Kneser Graphs. - Dániel Gerbner; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Máté Vizer (Electron. J. Comb., 2019)

Domination game on uniform hypergraphs. - Csilla Bujtás; Balázs Patkós; Zsolt Tuza; Máté Vizer (Discret. Appl. Math., 2019)

Majority problems of large query size. - Dániel Gerbner; Máté Vizer (Discret. Appl. Math., 2019)

Generalized Turán problems for disjoint copies of graphs. - Dániel Gerbner; Abhishek Methuku; Máté Vizer (Discret. Math., 2019)

On the Number of Containments in P-free Families. - Dániel Gerbner; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Máté Vizer (Graphs Comb., 2019)

Asymptotics for the Turán number of Berge-K2, t. - Dániel Gerbner; Abhishek Methuku; Máté Vizer (J. Comb. Theory B, 2019)

An improvement on the maximum number of k?dominating independent sets. - Dániel Gerbner; Balázs Keszegh; Abhishek Methuku; Balázs Patkós; Máté Vizer (J. Graph Theory, 2019)

Forbidding Rank-Preserving Copies of a Poset. - Dániel Gerbner; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Máté Vizer (Order, 2019)

Smart elements in combinatorial group testing problems with more defectives. - Máté Vizer; Dániel Gerbner (Art Discret. Appl. Math., 2020)

On clique coverings of complete multipartite graphs. - Akbar Davoodi; Dániel Gerbner; Abhishek Methuku; Máté Vizer (Discret. Appl. Math., 2020)

Rounds in a combinatorial search problem. - Dániel Gerbner; Máté Vizer (Discret. Appl. Math., 2020)

Preface: 2nd Russian-Hungarian Combinatorial Workshop. - Gyula O. H. Katona; Andrei M. Raigorodskii; Máté Vizer (Discret. Appl. Math., 2020)

Edge-ordered Ramsey numbers. - Martin Balko; Máté Vizer (Eur. J. Comb., 2020)

Generalized Turán problems for even cycles. - Dániel Gerbner; Ervin Györi; Abhishek Methuku; Máté Vizer (J. Comb. Theory B, 2020)

Ramsey Problems for Berge Hypergraphs. - Dániel Gerbner; Abhishek Methuku; Gholam Reza Omidi; Máté Vizer (SIAM J. Discret. Math., 2020)

t-Wise Berge and t-Heavy Hypergraphs. - Dániel Gerbner; Dániel T. Nagy; Balázs Patkós; Máté Vizer (SIAM J. Discret. Math., 2020)

Supersaturation, Counting, and Randomness in Forbidden Subposet Problems. - Dániel Gerbner; Dániel T. Nagy; Balázs Patkós; Máté Vizer (Electron. J. Comb., 2021)

Adaptive majority problems for restricted query graphs and for weighted sets. - 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 (Discret. Appl. Math., 2021)

On Grundy total domination number in product graphs. - Bostjan Bresar; Csilla Bujtás; Tanja Gologranc; Sandi Klavzar; Gasper Kosmrlj; Tilen Marc; Balázs Patkós; Zsolt Tuza; Máté Vizer (Discuss. Math. Graph Theory, 2021)

On non-adaptive majority problems of large query size. - Dániel Gerbner; Máté Vizer (Discret. Math. Theor. Comput. Sci., 2021)

On the maximum number of copies of H in graphs with given size and order. - Dániel Gerbner; Dániel T. Nagy; Balázs Patkós; Máté Vizer (J. Graph Theory, 2021)

Forbidden subposet problems in the grid. - Dániel Gerbner; Dániel T. Nagy; Balázs Patkós; Máté Vizer (Discret. Math., 2022)

Unified approach to the generalized Turán problem and supersaturation. - Dániel Gerbner; Zoltán Lóránt Nagy; Máté Vizer (Discret. Math., 2022)

Saturation problems with regularity constraints. - Dániel Gerbner; Balázs Patkós; Zsolt Tuza; Máté Vizer (Discret. Math., 2022)

Singular Turán numbers and WORM-colorings. - Dániel Gerbner; Balázs Patkós; Zsolt Tuza; Máté Vizer (Discuss. Math. Graph Theory, 2022)

On saturation of Berge hypergraphs. - Dániel Gerbner; Balázs Patkós; Zsolt Tuza; Máté Vizer (Eur. J. Comb., 2022)

On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs. - Martin Balko; Máté Vizer (SIAM J. Discret. Math., 2022)

Rainbow Ramsey Problems for the Boolean Lattice. - Fei-Huang Chang; Dániel Gerbner; Wei-Tian Li; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Máté Vizer (Order, 2022)

Improved Lower Bounds for Multiplicative Square-Free Sequences. - Péter Pál Pach; Máté Vizer (Electron. J. Comb., 2023)

A plurality problem with three colors and query size three. - Dániel Gerbner; Dániel Lenger; Máté Vizer (Discret. Math., 2023)

Vector sum-intersection theorems. - Balázs Patkós; Zsolt Tuza; Máté Vizer (Discret. Math., 2023)

Turán problems for edge-ordered graphs. - Dániel Gerbner; Abhishek Methuku; Dániel T. Nagy; Dömötör Pálvölgyi; Gábor Tardos; Máté Vizer (J. Comb. Theory B, 2023)

On graphs that contain exactly k copies of a subgraph, and a related problem in search theory. - 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 (Discret. Appl. Math., 2023)

Stability of extremal connected hypergraphs avoiding Berge-paths. - Dániel Gerbner; Dániel T. Nagy; Balázs Patkós; Nika Salia; Máté Vizer (Eur. J. Comb., 2024)

Counting connected partitions of graphs. - Yair Caro; Balázs Patkós; Zsolt Tuza; Máté Vizer (J. Graph Theory, 2024)

Some exact results for regular Turán problems for all large orders. - Dániel Gerbner; Balázs Patkós; Zsolt Tuza; Máté Vizer (Eur. J. Comb., 2024)

Extremal Graph Theoretic Questions for q-Ary Vectors. - Balázs Patkós; Zsolt Tuza; Máté Vizer (Graphs Comb., 2024)

The Robust Chromatic Number of Graphs. - Gábor Bacsó; Balázs Patkós; Zsolt Tuza; Máté Vizer (Graphs Comb., 2024)

Generalized saturation game. - Balázs Patkós; Milos Stojakovic; Jelena Stratijev; Máté Vizer (Discret. Appl. Math., 2025)

Edge mappings of graphs: Turán type parameters. - Yair Caro; Balázs Patkós; Zsolt Tuza; Máté Vizer (Eur. J. Comb., 2025)

The generalized trifference problem. - Anurag Bishnoi; Bartlomiej Kielak; Benedek Kovács; Zoltán Lóránt Nagy; Gábor Somlai; Máté Vizer; Zeyu Zheng (CoRR, 2025)