Balázs Patkós

According to our database, Balázs Patkós authored at least 70 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

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., March, 2024

Generalized Turán results for intersecting cliques.

Dániel Gerbner, Balázs Patkós

Discret. Math., January, 2024

On Some Extremal and Probabilistic Questions for Tree Posets.

Balázs Patkós, Andrew Treglown

Electron. J. Comb., 2024

2023

On graphs that contain exactly <i>k</i> 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., December, 2023

On the number of maximal independent sets: From Moon-Moser to Hujter-Tuza.

Cory Palmer, Balázs Patkós

J. Graph Theory, October, 2023

Vector sum-intersection theorems.

Balázs Patkós, Zsolt Tuza, Máté Vizer

Discret. Math., 2023

Query complexity of Boolean functions on the middle slice of the cube.

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

CoRR, 2023

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, October, 2022

On Generalized Turán Results in Height Two Posets.

József Balogh, Ryan R. Martin, Dániel T. Nagy, Balázs Patkós

SIAM J. Discret. Math., June, 2022

Generalized Turán Problems for Complete Bipartite Graphs.

Dániel Gerbner, Balázs Patkós

Graphs Comb., 2022

On saturation of Berge hypergraphs.

Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer

Eur. J. Comb., 2022

VC-saturated set systems.

Nóra Frankl, Sergei Kiselev, Andrey Kupavskii, Balázs Patkós

Eur. J. Comb., 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

Saturation problems with regularity constraints.

Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer

Discret. Math., 2022

Forbidden subposet problems in the grid.

Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer

Discret. Math., 2022

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

Induced and non-induced poset saturation problems.

Balázs Keszegh, Nathan Lemons, Ryan R. Martin, Dömötör Pálvölgyi, Balázs Patkós

J. Comb. Theory, Ser. A, 2021

On L-Close Sperner Systems.

Dániel T. Nagy, Balázs Patkós

Graphs Comb., 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

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

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

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

Generalized Forbidden Subposet Problems.

Dániel Gerbner, Balázs Keszegh, Balázs Patkós

Order, 2020

Distribution of colors in Gallai colorings.

András Gyárfás, Dömötör Pálvölgyi, Balázs Patkós, Matthew Wales

Eur. J. Comb., 2020

Set systems related to a house allocation problem.

Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Casey Tompkins, Chuanqi Xiao

Discret. Math., 2020

On colorings of the Boolean lattice avoiding a rainbow copy of a poset.

Balázs Patkós

Discret. Appl. Math., 2020

Finding non-minority balls with majority and plurality queries.

Huilan Chang, Dániel Gerbner, Balázs Patkós

Discret. Appl. Math., 2020

On the general position problem on Kneser graphs.

Balázs Patkós

Ars Math. Contemp., 2020

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

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

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

Domination game on uniform hypergraphs.

Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer

Discret. Appl. Math., 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

2018

On the Number of Cycles in a Graph with Restricted Cycle Lengths.

Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós

SIAM J. Discret. Math., 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

Forbidden Subposet Problems for Traces of Set Families.

Dániel Gerbner, Balázs Patkós, Máté Vizer

Electron. J. Comb., 2018

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

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

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

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

2015

Supersaturation and stability for forbidden subposet problems.

Balázs Patkós

J. Comb. Theory, Ser. A, 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

Avoider-Enforcer star games.

Andrzej Grzesik, Mirjana Mikalacki, Zoltán Lóránt Nagy, Alon Naor, Balázs Patkós, Fiona Skerman

Discret. Math. Theor. Comput. Sci., 2015

Search problems in vector spaces.

Tamás Héger, Balázs Patkós, Marcella Takáts

Des. Codes Cryptogr., 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

Induced and Non-induced Forbidden Subposet Problems.

Balázs Patkós

Electron. J. Comb., 2015

On the Number of Maximal Intersecting $k$-Uniform Families and Further Applications of Tuza's Set Pair Method.

Zoltán Lóránt Nagy, Balázs Patkós

Electron. J. Comb., 2015

2014

Nonrepetitive colorings of lexicographic product of graphs.

Balázs Keszegh, Balázs Patkós, Xuding Zhu

Discret. Math. Theor. Comput. Sci., 2014

2013

Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets.

Dániel Gerbner, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós, Vajk Szécsi

Graphs Comb., 2013

Saturating Sperner Families.

Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós

Graphs 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

Towards a de Bruijn-Erdős Theorem in the L₁-Metric.

Ida Kantor, Balázs Patkós

Discret. Comput. Geom., 2013

Majority and plurality problems.

Dániel Gerbner, Gyula O. H. Katona, Dömötör Pálvölgyi, Balázs Patkós

Discret. Appl. Math., 2013

Families that Remain k-Sperner Even After Omitting an Element of their Ground Set.

Balázs Patkós

Electron. J. Comb., 2013

2012

Almost Intersecting Families of Sets.

Dániel Gerbner, Nathan Lemons, Cory Palmer, Balázs Patkós, Vajk Szécsi

SIAM J. Discret. Math., 2012

Large B_d-Free and Union-free Subfamilies.

János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós

SIAM J. Discret. Math., 2012

Two-Part Set Systems.

Péter L. Erdös, Dániel Gerbner, Nathan Lemons, Dhruv Mubayi, Cory Palmer, Balázs Patkós

Electron. J. Comb., 2012

2011

Random Partial Orders Defined by Angular Domains.

Paul Balister, Balázs Patkós

Order, 2011

Large Bd-free and union-free subfamilies.

János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós

Electron. Notes Discret. Math., 2011

2010

Shadows and intersections in vector spaces.

Ameera Chowdhury, Balázs Patkós

J. Comb. Theory, Ser. A, 2010

Polychromatic colorings of arbitrary rectangular partitions.

Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós

Discret. Math., 2010

Finding the maximum and minimum elements with one lie.

Dániel Gerbner, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener

Discret. Appl. Math., 2010

On Randomly Generated Non-Trivially Intersecting Hypergraphs.

Balázs Patkós

Electron. J. Comb., 2010

A Hilton-Milner Theorem for Vector Spaces.

Aart Blokhuis, Andries E. Brouwer, Ameera Chowdhury, Peter Frankl, T. Mussche, Balázs Patkós, Tamás Szönyi

Electron. J. Comb., 2010

2009

Equitable coloring of random graphs.

Michael Krivelevich, Balázs Patkós

Random Struct. Algorithms, 2009

l-trace k-Sperner families of sets.

Balázs Patkós

J. Comb. Theory, Ser. A, 2009

Profile vectors in the lattice of subspaces.

Dániel Gerbner, Balázs Patkós

Discret. Math., 2009

Traces of Uniform Families of Sets.

Balázs Patkós

Electron. J. Comb., 2009

2008

l-Chain Profile Vectors.

Dániel Gerbner, Balázs Patkós

SIAM J. Discret. Math., 2008

2005

How Different Can Two Intersecting Families Be?

Balázs Patkós

Electron. J. Comb., 2005