Name
Affiliation
Papers
BALÁZS PATKÓS
Hungarian Acad Sci, Alfred Renyi Inst Math, POB 127, H-1364 Budapest, Hungary
49
Collaborators
Citations 
PageRank 
67
85
21.60
Referers 
Referees 
References 
158
297
223
Search Limit
100297
Title
Citations
PageRank
Year
Saturation problems with regularity constraints00.342022
Induced and non-induced poset saturation problems00.342021
Supersaturation, Counting, And Randomness In Forbidden Subposet Problems00.342021
Adaptive Majority Problems For Restricted Query Graphs And For Weighted Sets00.342021
$t$-Wise Berge and $t$-Heavy Hypergraphs00.342020
Distribution of colors in Gallai colorings00.342020
Set systems related to a house allocation problem00.342020
On The General Position Problem On Kneser Graphs00.342020
On the Number of Containments in P-free Families.00.342019
Domination game on uniform hypergraphs.10.362019
Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets.00.342019
Stability results for vertex Turatn problems in Kneser graphs00.342019
On the Number of Cycles in a Graph with Restricted Cycle Lengths.20.422018
Line Percolation in Finite Projective Planes.00.342018
Forbidden Subposet Problems for Traces of Set Families.00.342018
Grundy dominating sequences and zero forcing sets.10.372017
The minimum number of vertices in uniform hypergraphs with given domination number.20.392017
Finding a non-minority ball with majority answers.20.392017
Dominating Sequences in Grid-Like and Toroidal Graphs.00.342016
Search problems in vector spaces20.742015
Finding a majority ball with majority answers.00.342015
Identifying codes and searching with balls in graphs20.472015
Supersaturation and stability for forbidden subposet problems.10.372015
Avoider-Enforcer star games.00.342015
Induced and Non-induced Forbidden Subposet Problems.00.342015
On the Number of Maximal Intersecting $k$-Uniform Families and Further Applications of Tuza's Set Pair Method.20.412015
Nonrepetitive colorings of lexicographic product of graphs.00.342014
Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets00.342013
Saturating Sperner Families20.522013
On the ratio of maximum and minimum degree in maximal intersecting families.00.342013
Towards a de Bruijn-Erdős Theorem in the L1-Metric.10.472013
Families that Remain k-Sperner Even After Omitting an Element of their Ground Set.00.342013
Large Bd-free and union-free subfamilies.00.342012
Majority and plurality problems00.342012
Almost Intersecting Families of Sets.30.502012
Two-Part Set Systems.00.342012
Random Partial Orders Defined by Angular Domains00.342011
A Hilton-Milner theorem for vector spaces211.312010
Finding the maximum and minimum elements with one lie10.382010
Polychromatic colorings of arbitrary rectangular partitions10.352010
On randomly generated non-trivially intersecting hypergraphs131.252010
Shadows and intersections in vector spaces161.132010
Traces of uniform families of sets30.552009
Note: l-trace k-Sperner families of sets10.372009
Profile vectors in the lattice of subspaces10.462009
Equitable coloring of random graphs20.642009
l-trace k-Sperner families of sets30.552009
l-Chain Profile Vectors20.442008
How Different Can Two Intersecting Families Be?00.342005