1 citations · 2 across the 8 of their papers we have counts for
5 papers · 1 filter
Positive co-degree densities and jumps
József Balogh, Anastasia Halfpap, Bernard Lidický +1
The minimum positive co-degree of a nonempty -graph , denoted by , is the largest integer such that for every -set , if is contai…
Subset selection problems in planar point sets
József Balogh, Felix Christian Clemen, Adrian Dumitrescu +1
Given a finite point set satisfying condition , the subset selection problem asks, how large of a subset satisfying condition can be extracted? In this p…
Sunflowers in set systems with small VC-dimension
József Balogh, Anton Bernshteyn, Michelle Delcourt +2
A family of distinct sets is an -sunflower if for all and , we have $A_i \cap A_j = A_…
Generalized Ramsey-Turán Numbers
József Balogh, Van Magnan, Cory Palmer
The Ramsey-Turán problem for asks for the maximum number of edges in an -vertex -free graph with independence number . In a natural generalization of the proble…
On multicolor Turán numbers
József Balogh, Anita Liebenau, Letícia Mattos +1
We address a problem which is a generalization of Turán-type problems recently introduced by Imolay, Karl, Nagy and Váli. Let be a fixed graph and let be the union of e…