Balázs Patkós

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 45

Top Topics

Projective Space

Boolean Functions

Graph Theoretic

Top Venues

Electron. J. Comb.

Discret. Appl. Math.

Publications

Balázs Patkós, Zsolt Tuza, Máté Vizer
Extremal Graph Theoretic Questions for q-Ary Vectors. Graphs Comb. 40 (3) (2024)
Balázs Patkós, Andrew Treglown
On Some Extremal and Probabilistic Questions for Tree Posets. Electron. J. Comb. 31 (1) (2024)
Dániel Gerbner, Balázs Patkós
Generalized Turán results for intersecting cliques. Discret. Math. 347 (1) (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)
Dániel Gerbner, Balázs Keszegh, Dániel T. Nagy, Kartal Nagy, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener
Query complexity of Boolean functions on the middle slice of the cube. CoRR (2023)
Balázs Patkós, Zsolt Tuza, Máté Vizer
Vector sum-intersection theorems. Discret. Math. 346 (10) (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)
Cory Palmer, Balázs Patkós
On the number of maximal independent sets: From Moon-Moser to Hujter-Tuza. J. Graph Theory 104 (2) (2023)
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)
Dániel Gerbner, Balázs Patkós
Generalized Turán Problems for Complete Bipartite Graphs. Graphs Comb. 38 (5) (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)
József Balogh, Ryan R. Martin, Dániel T. Nagy, Balázs Patkós
On Generalized Turán Results in Height Two Posets. SIAM J. Discret. Math. 36 (2) (2022)
Nóra Frankl, Sergei Kiselev, Andrey Kupavskii, Balázs Patkós
VC-saturated set systems. Eur. J. Comb. 104 (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 T. Nagy, Balázs Patkós
On L-Close Sperner Systems. Graphs Comb. 37 (3) (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, 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)
Balázs Keszegh, Nathan Lemons, Ryan R. Martin, Dömötör Pálvölgyi, Balázs Patkós
Induced and non-induced poset saturation problems. J. Comb. Theory, Ser. A 184 (2021)
Balázs Patkós
On the general position problem on Kneser graphs. Ars Math. Contemp. 18 (2) (2020)
Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Casey Tompkins, Chuanqi Xiao
Set systems related to a house allocation problem. Discret. Math. 343 (7) (2020)
András Gyárfás, Dömötör Pálvölgyi, Balázs Patkós, Matthew Wales
Distribution of colors in Gallai colorings. Eur. J. Comb. 86 (2020)
Balázs Patkós
On colorings of the Boolean lattice avoiding a rainbow copy of a poset. Discret. Appl. Math. 276 (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)
Dániel Gerbner, Balázs Keszegh, Balázs Patkós
Generalized Forbidden Subposet Problems. Order 37 (2) (2020)
Huilan Chang, Dániel Gerbner, Balázs Patkós
Finding non-minority balls with majority and plurality queries. Discret. Appl. Math. 284 (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)
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, 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, 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, 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)
Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós
On the Number of Cycles in a Graph with Restricted Cycle Lengths. SIAM J. Discret. Math. 32 (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)
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)
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)
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)
Andrzej Grzesik, Mirjana Mikalacki, Zoltán Lóránt Nagy, Alon Naor, Balázs Patkós, Fiona Skerman
Avoider-Enforcer star games. Discret. Math. Theor. Comput. Sci. 17 (1) (2015)
Balázs Patkós
Induced and Non-induced Forbidden Subposet Problems. Electron. J. Comb. 22 (1) (2015)
Zoltán Lóránt Nagy, Balázs Patkós
On the Number of Maximal Intersecting $k$-Uniform Families and Further Applications of Tuza's Set Pair Method. Electron. J. Comb. 22 (1) (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)
Tamás Héger, Balázs Patkós, Marcella Takáts
Search problems in vector spaces. Des. Codes Cryptogr. 76 (2) (2015)
Balázs Patkós
Supersaturation and stability for forbidden subposet problems. J. Comb. Theory, Ser. A 136 (2015)
Balázs Keszegh, Balázs Patkós, Xuding Zhu
Nonrepetitive colorings of lexicographic product of graphs. Discret. Math. Theor. Comput. Sci. 16 (2) (2014)
Balázs Patkós
Families that Remain k-Sperner Even After Omitting an Element of their Ground Set. Electron. J. Comb. 20 (1) (2013)
Dániel Gerbner, Gyula O. H. Katona, Dömötör Pálvölgyi, Balázs Patkós
Majority and plurality problems. Discret. Appl. Math. 161 (6) (2013)
Ida Kantor, Balázs Patkós
-Metric. Discret. Comput. Geom. 49 (3) (2013)
Dániel Gerbner, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós, Vajk Szécsi
Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets. Graphs Comb. 29 (3) (2013)
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)
Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós
Saturating Sperner Families. Graphs Comb. 29 (5) (2013)
Dániel Gerbner, Gyula O. H. Katona, Dömötör Pálvölgyi, Balázs Patkós
Majority and Plurality Problems CoRR (2012)
János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós
-Free and Union-free Subfamilies. SIAM J. Discret. Math. 26 (1) (2012)
Péter L. Erdös, Dániel Gerbner, Nathan Lemons, Dhruv Mubayi, Cory Palmer, Balázs Patkós
Two-Part Set Systems. Electron. J. Comb. 19 (1) (2012)
Dániel Gerbner, Nathan Lemons, Cory Palmer, Balázs Patkós, Vajk Szécsi
Almost Intersecting Families of Sets. SIAM J. Discret. Math. 26 (4) (2012)
János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós
Large Bd-free and union-free subfamilies. Electron. Notes Discret. Math. 38 (2011)
Paul Balister, Balázs Patkós
Random Partial Orders Defined by Angular Domains. Order 28 (2) (2011)
Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós
Polychromatic colorings of arbitrary rectangular partitions. Discret. Math. 310 (1) (2010)
Balázs Patkós
On Randomly Generated Non-Trivially Intersecting Hypergraphs. Electron. J. Comb. 17 (1) (2010)
Aart Blokhuis, Andries E. Brouwer, Ameera Chowdhury, Peter Frankl, T. Mussche, Balázs Patkós, Tamás Szönyi
A Hilton-Milner Theorem for Vector Spaces. Electron. J. Comb. 17 (1) (2010)
Ameera Chowdhury, Balázs Patkós
Shadows and intersections in vector spaces. J. Comb. Theory, Ser. A 117 (8) (2010)
Dániel Gerbner, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener
Finding the maximum and minimum elements with one lie. Discret. Appl. Math. 158 (9) (2010)
Michael Krivelevich, Balázs Patkós
Equitable coloring of random graphs. Random Struct. Algorithms 35 (1) (2009)
Balázs Patkós
l-trace k-Sperner families of sets. J. Comb. Theory, Ser. A 116 (5) (2009)
Dániel Gerbner, Balázs Patkós
Profile vectors in the lattice of subspaces. Discret. Math. 309 (9) (2009)
Balázs Patkós
Traces of Uniform Families of Sets. Electron. J. Comb. 16 (1) (2009)
Dániel Gerbner, Balázs Patkós
l-Chain Profile Vectors. SIAM J. Discret. Math. 22 (1) (2008)
Balázs Patkós
How Different Can Two Intersecting Families Be? Electron. J. Comb. 12 (2005)