default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBalázs Patkós
Person information
- affiliation: Alfréd Rényi Institute of Mathematics, Budapest, Hungary
- affiliation (former): Eötvös Loránd University, Budapest, Hungary
- affiliation (former): University of Memphis, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j72]Balázs Patkós, Andrew Treglown:
On Some Extremal and Probabilistic Questions for Tree Posets. Electron. J. Comb. 31(1) (2024)- [j71]Dániel Gerbner
, Balázs Patkós:
Generalized Turán results for intersecting cliques. Discret. Math. 347(1): 113710 (2024) - [j70]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: 103828 (2024) - [j69]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: 103930 (2024) - [j68]Balázs Patkós, Zsolt Tuza, Máté Vizer:
Extremal Graph Theoretic Questions for q-Ary Vectors. Graphs Comb. 40(3): 57 (2024) - [j67]Gábor Bacsó, Balázs Patkós, Zsolt Tuza, Máté Vizer:
The Robust Chromatic Number of Graphs. Graphs Comb. 40(4): 89 (2024) - [i4]Balázs Patkós, Milos Stojakovic, Jelena Stratijev, Máté Vizer:
Generalized saturation game. CoRR abs/2404.02288 (2024) - 2023
- [j66]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:
On graphs that contain exactly k copies of a subgraph, and a related problem in search theory. Discret. Appl. Math. 341: 196-203 (2023) - [j65]Balázs Patkós, Zsolt Tuza, Máté Vizer:
Vector sum-intersection theorems. Discret. Math. 346(10): 113506 (2023) - [j64]Cory Palmer, Balázs Patkós:
On the number of maximal independent sets: From Moon-Moser to Hujter-Tuza. J. Graph Theory 104(2): 440-445 (2023) - [i3]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 abs/2309.13678 (2023) - 2022
- [j63]Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
Forbidden subposet problems in the grid. Discret. Math. 345(3): 112720 (2022) - [j62]Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Saturation problems with regularity constraints. Discret. Math. 345(8): 112921 (2022) - [j61]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): 1061-1074 (2022) - [j60]Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
On saturation of Berge hypergraphs. Eur. J. Comb. 102: 103477 (2022) - [j59]Nóra Frankl, Sergei Kiselev, Andrey Kupavskii, Balázs Patkós:
VC-saturated set systems. Eur. J. Comb. 104: 103528 (2022) - [j58]Dániel Gerbner, Balázs Patkós:
Generalized Turán Problems for Complete Bipartite Graphs. Graphs Comb. 38(5): 164 (2022) - [j57]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): 453-463 (2022) - [j56]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): 1483-1495 (2022) - 2021
- [j55]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): 1 (2021) - [j54]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: 235-245 (2021) - [j53]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): 225-247 (2021) - [j52]Dániel T. Nagy, Balázs Patkós:
On L-Close Sperner Systems. Graphs Comb. 37(3): 789-796 (2021) - [j51]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 A 184: 105497 (2021) - [j50]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): 34-43 (2021) - 2020
- [j49]Balázs Patkós:
On the general position problem on Kneser graphs. Ars Math. Contemp. 18(2): 273-280 (2020) - [j48]Balázs Patkós:
On colorings of the Boolean lattice avoiding a rainbow copy of a poset. Discret. Appl. Math. 276: 108-114 (2020) - [j47]Huilan Chang, Dániel Gerbner, Balázs Patkós:
Finding non-minority balls with majority and plurality queries. Discret. Appl. Math. 284: 631-639 (2020) - [j46]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): 111886 (2020) - [j45]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: 103087 (2020) - [j44]Dániel Gerbner, Balázs Keszegh, Balázs Patkós:
Generalized Forbidden Subposet Problems. Order 37(2): 389-410 (2020) - [j43]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): 1813-1829 (2020)
2010 – 2019
- 2019
- [j42]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): 2 (2019) - [j41]Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Domination game on uniform hypergraphs. Discret. Appl. Math. 258: 65-75 (2019) - [j40]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): 1519-1540 (2019) - [j39]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): 88-97 (2019) - [j38]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): 611-620 (2019) - [i2]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 abs/1903.08383 (2019) - 2018
- [j37]Dániel Gerbner, Balázs Patkós, Máté Vizer:
Forbidden Subposet Problems for Traces of Set Families. Electron. J. Comb. 25(3): 3 (2018) - [j36]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): 266-279 (2018) - [j35]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): 864-881 (2018) - 2017
- [j34]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: 18-31 (2017) - [j33]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: 66-77 (2017) - [j32]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): 2704-2713 (2017) - 2016
- [j31]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): 4 (2016) - 2015
- [j30]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): 1 (2015) - [j29]Balázs Patkós:
Induced and Non-induced Forbidden Subposet Problems. Electron. J. Comb. 22(1): 1 (2015) - [j28]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: 39-47 (2015) - [j27]Tamás Héger, Balázs Patkós, Marcella Takáts:
Search problems in vector spaces. Des. Codes Cryptogr. 76(2): 207-216 (2015) - [j26]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): 145-160 (2015) - [j25]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: 345-351 (2015) - [j24]Balázs Patkós:
Supersaturation and stability for forbidden subposet problems. J. Comb. Theory A 136: 220-237 (2015) - 2014
- [j23]Balázs Keszegh, Balázs Patkós, Xuding Zhu:
Nonrepetitive colorings of lexicographic product of graphs. Discret. Math. Theor. Comput. Sci. 16(2): 97-110 (2014) - 2013
- [j22]Balázs Patkós:
Families that Remain k-Sperner Even After Omitting an Element of their Ground Set. Electron. J. Comb. 20(1): 32 (2013) - [j21]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): 813-818 (2013) - [j20]Ida Kantor, Balázs Patkós:
Towards a de Bruijn-Erdős Theorem in the L1-Metric. Discret. Comput. Geom. 49(3): 659-670 (2013) - [j19]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): 207-211 (2013) - [j18]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): 489-498 (2013) - [j17]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): 1355-1364 (2013) - 2012
- [j16]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): 52 (2012) - [j15]János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós:
Large Bd-Free and Union-free Subfamilies. SIAM J. Discret. Math. 26(1): 71-76 (2012) - [j14]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): 1657-1669 (2012) - [i1]Dániel Gerbner, Gyula O. H. Katona, Dömötör Pálvölgyi, Balázs Patkós:
Majority and Plurality Problems. CoRR abs/1203.1398 (2012) - 2011
- [j13]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: 101-104 (2011) - [j12]Paul Balister, Balázs Patkós:
Random Partial Orders Defined by Angular Domains. Order 28(2): 341-355 (2011) - 2010
- [j11]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) - [j10]Balázs Patkós:
On Randomly Generated Non-Trivially Intersecting Hypergraphs. Electron. J. Comb. 17(1) (2010) - [j9]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): 988-995 (2010) - [j8]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): 21-30 (2010) - [j7]Ameera Chowdhury, Balázs Patkós:
Shadows and intersections in vector spaces. J. Comb. Theory A 117(8): 1095-1106 (2010)
2000 – 2009
- 2009
- [j6]Balázs Patkós:
Traces of Uniform Families of Sets. Electron. J. Comb. 16(1) (2009) - [j5]Dániel Gerbner, Balázs Patkós:
Profile vectors in the lattice of subspaces. Discret. Math. 309(9): 2861-2869 (2009) - [j4]Balázs Patkós:
l-trace k-Sperner families of sets. J. Comb. Theory A 116(5): 1047-1055 (2009) - [j3]Michael Krivelevich, Balázs Patkós:
Equitable coloring of random graphs. Random Struct. Algorithms 35(1): 83-99 (2009) - 2008
- [j2]Dániel Gerbner, Balázs Patkós:
l-Chain Profile Vectors. SIAM J. Discret. Math. 22(1): 185-193 (2008) - 2005
- [j1]Balázs Patkós:
How Different Can Two Intersecting Families Be? Electron. J. Comb. 12 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
