József Balogh

activity

20232026

most citedSunflowers in set systems with small VC-dimension

1 citations · 2 across the 8 of their papers we have counts for

collaborators

Showing math.COShow all

8 papers · 1 filter

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★ 1 cited

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★ 1 cited

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_…

math.CO2024

Generalized Ramsey-Turán Numbers

József Balogh, Van Magnan, Cory Palmer

The Ramsey-Turán problem for $K_{p}$ asks for the maximum number of edges in an $n$ -vertex $K_{p}$ -free graph with independence number $o (n)$ . In a natural generalization of the proble…

math.CO2024

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 $F$ be a fixed graph and let $G$ be the union of $k$ e…

math.CO2023

On a Traveling Salesman Problem for Points in the Unit Cube

József Balogh, Felix Christian Clemen, Adrian Dumitrescu

Let $X$ be an $n$ -element point set in the $k$ -dimensional unit cube $[0, 1]^{k}$ where $k \geq 2$ . According to an old result of Bollobás and Meir (1992), there exists a cycle (tour)…