József Balogh

collaborators

5 papers

math.CO2026

Local maximum of inducibility profiles

József Balogh, Bernard Lidický, Haoran Luo

For a graph $G$ and $e \in [0, 1]$ , denote by $I_{G} (e)$ the supremum of induced density of $G$ over $n$ -vertex graphs with edge density $e$ as $n$ goes to infinity. Liu, Mubayi and Re…

math.CO2026

Matchings in hypergraphs via Ore-degree conditions

József Balogh, Cory Palmer, Ghaffar Raeisi

Let $H \subseteq (r [ n ])$ be an $r$ -uniform hypergraph on vertex set $[n] = {1, 2, \dots, n}$ . For an $r$ -set of vertices $S \subseteq [n]$ , the \emph{degree} of $…

math.CO2024

Positive co-degree densities and jumps

József Balogh, Anastasia Halfpap, Bernard Lidický +1

The minimum positive co-degree of a nonempty $r$ -graph $H$ , denoted by $δ_{r - 1}^{+} (H)$ , is the largest integer $k$ such that for every $(r - 1)$ -set $S \subset V (H)$ , if $S$ is contai…

math.CO2024

Subset selection problems in planar point sets

József Balogh, Felix Christian Clemen, Adrian Dumitrescu +1

Given a finite point set satisfying condition $A$ , the subset selection problem asks, how large of a subset satisfying condition $B$ can be extracted? In this p…

math.CO2024

Sunflowers in set systems with small VC-dimension

József Balogh, Anton Bernshteyn, Michelle Delcourt +2

A family of $r$ distinct sets ${A_{1}, \dots, A_{r}}$ is an $r$ -sunflower if for all $1 ⩽ i < j ⩽ r$ and $1 ⩽ i^{'} < j^{'} ⩽ r$ , we have $A_i \cap A_j = A_…