Máté Vizer
Impact in
-
- Limits and Structures in Graph Theory
- Finite Group Theory Research
- Geometry and Topology top 5%
- Graph theory and applications
- Advanced Topology and Set Theory
Papers in
-
- Limits and Structures in Graph Theory 22
- Finite Group Theory Research 4
-
- Advanced Graph Theory Research 20
- Graph Labeling and Dimension Problems 5
- Co-authors
- Dániel Gerbner (17 shared papers)Abhishek Methuku (11 shared papers)Balázs Patkós (15 shared papers)Ervin Győri (3 shared papers)Boštjan Brešar (2 shared papers)Csilla Bujtás (2 shared papers)Źsolt Tuza (4 shared papers)Sandi Klavžar (2 shared papers)
- Journals
- The Electronic Journal of Combinatorics (7 papers)European Journal of Combinatorics (4 papers)Journal of Combinatorial Theory Series B (3 papers)Discrete Mathematics (3 papers)Journal of Fourier Analysis and Applications (1 paper)
- Partner nations
- HungarySwitzerlandCzechia
In The Last Decade
Máté Vizer
26 papers receiving 165 citations
Peers
Comparison fields: 5 of 20
- Discrete Mathematics and Combinatorics 112
- Geometry and Topology 79
- Computational Theory and Mathematics 142
- Computational Mathematics 3
- Mathematical Physics 8
Countries citing papers authored by Máté Vizer
This map shows the geographic impact of Máté Vizer's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Máté Vizer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Máté Vizer more than expected).
Fields of papers citing papers by Máté Vizer
This network shows the impact of papers produced by Máté Vizer. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Máté Vizer. The network helps show where Máté Vizer may publish in the future.
Co-authors
The 22 scholars most cited alongside Máté Vizer, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 33 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2020 | 28 | |
| 2 | 2019 | 25 | |
| 3 | 2015 | 24 | |
| 4 | 2019 | 17 | |
| 5 | 2017 | 15 | |
| 6 | 2022 | 10 | |
| 7 | 2016 | 8 | |
| 8 | 2021 | 5 | |
| 9 | 2014 | 4 | |
| 10 | 2023 | 4 | |
| 11 | 2015 | 4 | |
| 12 | 2018 | 4 | |
| 13 | 2018 | 3 | |
| 14 | 2018 | 3 | |
| 15 | 2020 | 3 | |
| 16 | 2024 | 2 | |
| 17 | 2019 | 2 | |
| 18 | Edge ordered Turán problems | 2019 | 1 |
| 19 | 2019 | 1 | |
| 20 | 2017 | 1 |
About Máté Vizer
Máté Vizer is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Electrical and Electronic Engineering and Computer Networks and Communications, having authored 33 papers that have together received 171 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (22 papers), Advanced Graph Theory Research (20 papers), Graph theory and applications (10 papers), Graph Labeling and Dimension Problems (5 papers), Advanced Topology and Set Theory (5 papers), Finite Group Theory Research (4 papers), graph theory and CDMA systems (4 papers) and Optimization and Search Problems (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (112 citations), Geometry and Topology (79 citations), Computational Theory and Mathematics (142 citations), Computational Mathematics (3 citations) and Mathematical Physics (8 citations). Máté Vizer has collaborated with scholars based in Hungary, Switzerland and Czechia. Frequent co-authors include Dániel Gerbner, Abhishek Methuku, Balázs Patkós, Ervin Győri, Boštjan Brešar, Csilla Bujtás, Źsolt Tuza, Sandi Klavžar, W. Li and Gábor Tardos. Their work appears in journals such as The Electronic Journal of Combinatorics, European Journal of Combinatorics, Journal of Combinatorial Theory Series B, Discrete Mathematics and Journal of Fourier Analysis and Applications.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.