Balázs Patkós

650 total citations
59 papers, 276 citations indexed

About

Balázs Patkós is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Balázs Patkós has authored 59 papers receiving a total of 276 indexed citations (citations by other indexed papers that have themselves been cited), including 45 papers in Computational Theory and Mathematics, 44 papers in Discrete Mathematics and Combinatorics and 24 papers in Geometry and Topology. Recurrent topics in Balázs Patkós's work include Limits and Structures in Graph Theory (44 papers), Advanced Graph Theory Research (37 papers) and Graph theory and applications (14 papers). Balázs Patkós is often cited by papers focused on Limits and Structures in Graph Theory (44 papers), Advanced Graph Theory Research (37 papers) and Graph theory and applications (14 papers). Balázs Patkós collaborates with scholars based in Hungary, United States and Russia. Balázs Patkós's co-authors include Dániel Gerbner, Dömötör Pálvölgyi, Máté Vizer, Balázs Keszegh, Nathan Lemons, Cory Palmer, Péter Frankl, A. Roy Chowdhury, Tamás Szőnyi and A. Blokhuis and has published in prestigious journals such as SHILAP Revista de lepidopterología, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Balázs Patkós

47 papers receiving 259 citations

Peers

Balázs Patkós
Alexander Soifer United States
Jozef Skokan United States
Juan José Montellano‐Ballesteros Mexico
Norbert Sauer Canada
Cheng Yeaw Ku Singapore
Louis Esperet France
Yufei Zhao United States
Norbert Seifter Austria
Choongbum Lee United States
Stephen C. Locke United States
Alexander Soifer United States
Balázs Patkós
Citations per year, relative to Balázs Patkós Balázs Patkós (= 1×) peers Alexander Soifer

Countries citing papers authored by Balázs Patkós

Since Specialization
Citations

This map shows the geographic impact of Balázs Patkós'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 Balázs Patkós with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Balázs Patkós more than expected).

Fields of papers citing papers by Balázs Patkós

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Balázs Patkós. 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 Balázs Patkós. The network helps show where Balázs Patkós may publish in the future.

Co-authorship network of co-authors of Balázs Patkós

This figure shows the co-authorship network connecting the top 25 collaborators of Balázs Patkós. A scholar is included among the top collaborators of Balázs Patkós based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Balázs Patkós. Balázs Patkós is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Patkós, Balázs. (2025). Size, diversity, minimum degree, sturdiness, dömdödöm. Ars Mathematica Contemporanea. 26(2). #P2.07–#P2.07.
2.
Patkós, Balázs & Andrew Treglown. (2024). On Some Extremal and Probabilistic Questions for Tree Posets. The Electronic Journal of Combinatorics. 31(1).
3.
Balogh, József, et al.. (2023). On the sizes of \(t\)-intersecting \(k\)-chain-free families. 3(2). 1 indexed citations
4.
Balogh, József, et al.. (2023). On the sizes of t-intersecting k-chain-free families. 101–106. 1 indexed citations
5.
Caro, Yair, Balázs Patkós, & Źsolt Tuza. (2023). Connected Turán number of trees. Ars Mathematica Contemporanea. 24(4). #P4.01–#P4.01. 1 indexed citations
6.
Patkós, Balázs, Miloš Stojaković, & Máté Vizer. (2023). The constructor-blocker game. Applicable Analysis and Discrete Mathematics. 18(1). 193–214.
7.
Gerbner, Dániel & Balázs Patkós. (2023). Generalized Turán results for intersecting cliques. Discrete Mathematics. 347(1). 113710–113710. 4 indexed citations
8.
Brešar, Boštjan, Csilla Bujtás, Sandi Klavžar, et al.. (2021). On Grundy Total Domination Number in Product Graphs. SHILAP Revista de lepidopterología. 3 indexed citations
9.
Patkós, Balázs, et al.. (2020). Singular Turán numbers and WORM-colorings. Discussiones Mathematicae Graph Theory. 42(4). 1061–1061. 1 indexed citations
10.
Patkós, Balázs. (2015). Induced and non-induced forbidden subposet problems \n. Repository of the Academy's Library (Library of the Hungarian Academy of Sciences). 6 indexed citations
11.
Patkós, Balázs, et al.. (2015). On the number of \nmaximal intersecting k-uniform families \nand further applications of Tuza’s set pair method. Repository of the Academy's Library (Library of the Hungarian Academy of Sciences). 1 indexed citations
12.
Patkós, Balázs. (2015). Supersaturation and stability for forbidden subposet problems. Journal of Combinatorial Theory Series A. 136. 220–237. 2 indexed citations
13.
Patkós, Balázs, et al.. (2013). Towards a de Bruijn–Erdős Theorem in the $$L_1$$ -Metric. Discrete & Computational Geometry. 49(3). 659–670. 6 indexed citations
14.
Gerbner, Dániel, Gyula O. H. Katona, Dömötör Pálvölgyi, & Balázs Patkós. (2012). Majority and plurality problems. Discrete Applied Mathematics. 161(6). 813–818. 3 indexed citations
15.
Erdős, Péter L., Dániel Gerbner, Nathan Lemons, et al.. (2012). Two-Part Set Systems. The Electronic Journal of Combinatorics. 19(1).
16.
Gerbner, Dániel, et al.. (2010). Finding the maximum and minimum elements with one lie. Discrete Applied Mathematics. 158(9). 988–995.
17.
Krivelevich, Michael & Balázs Patkós. (2009). Equitable coloring of random graphs. Random Structures and Algorithms. 35(1). 83–99. 3 indexed citations
18.
Gerbner, Dániel, et al.. (2009). Polychromatic colorings of arbitrary rectangular partitions. Discrete Mathematics. 310(1). 21–30. 1 indexed citations
19.
Patkós, Balázs, et al.. (2009). Shadows and intersections in vector spaces. Journal of Combinatorial Theory Series A. 117(8). 1095–1106. 28 indexed citations
20.
Gerbner, Dániel & Balázs Patkós. (2008). Profile vectors in the lattice of subspaces. Discrete Mathematics. 309(9). 2861–2869. 3 indexed citations

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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Alexander Soifer Breakdown of academic impact, for papers by Jozef Skokan Breakdown of academic impact, for papers by Juan José Montellano‐Ballesteros Breakdown of academic impact, for papers by Norbert Sauer Breakdown of academic impact, for papers by Cheng Yeaw Ku Breakdown of academic impact, for papers by Louis Esperet Breakdown of academic impact, for papers by Yufei Zhao Breakdown of academic impact, for papers by Norbert Seifter Breakdown of academic impact, for papers by Choongbum Lee Breakdown of academic impact, for papers by Stephen C. Locke
Rankless by CCL
2026