József Balogh

activity

20242026

collaborators

8 papers

math.CO2026

Bipartite cuts in Ramsey-TurÃ¡n style

JÃ³zsef Balogh, Ce Chen, Bernard LidickÃ½

We prove that every $K_{5}$ -free $n$ -vertex graph with sublinear independence number can be made bipartite by removing at most $n^{2} (1/18 + o (1))$ edges, where the constant $1/18$ is be…

math.CO2026

Balanced bipartite distance of $K_{4}$ -free graphs

JÃ³zsef Balogh, Ignacy Buczek, Andrzej Grzesik +1

We show that every $K_{4}$ -free graph on $n$ vertices can be made balanced bipartite by removing at most $\frac{n ^{2}}{9}$ edges. This proves a conjecture of Balogh, Clemen, and Lidick…

math.CO2026

Forbidding Exactly One Hamming Distance

JÃ³zsef Balogh, Ce Chen, Bowen Li

Addressing questions raised in recent papers, we study the $r$ -distance graph $H_{r} (n)$ on the Boolean cube ${0, 1}^{n}$ , where two vertices are adjacent if their Hamming distance is…

math.CO2026

A Jump in the Codegree TurÃ¡n Densities of Long Tight Cycles

JÃ³zsef Balogh, Haoran Luo, Maya Sankar

We study the codegree TurÃ¡n density of $C_{ℓ}^{r}$ , the $r$ -uniform hypergraph tight cycle of length $ℓ$ . A result of Han, Lo, and Sanhueza-Matamala states that if $\e…

math.CO2026

Maximum number of points in general position in a random subset of finite $3$ -dimensional spaces

JÃ³zsef Balogh, Haoran Luo

Let $I^\pm (F_{q}^{d}, p)$ be the maximum possible size of a point set in general position in the $p$ -random subset of $F_{q}^{d}$ . In this note, we determine the order of m…

math.CO2025

Maximal independent sets in the middle two layers of the Boolean lattice

JÃ³zsef Balogh, Ce Chen, Ramon I. Garcia

Let $B (2 d - 1, d)$ be the subgraph of the hypercube $Q_{2 d - 1}$ induced by its two largest layers. Duffus, Frankl and RÃ¶dl proposed the problem of finding the asymptotics f…

Bipartite cuts in Ramsey-TurÃ¡n style

Balanced bipartite distance of K4​-free graphs

Forbidding Exactly One Hamming Distance

A Jump in the Codegree TurÃ¡n Densities of Long Tight Cycles

Maximum number of points in general position in a random subset of finite 3-dimensional spaces

Maximal independent sets in the middle two layers of the Boolean lattice

Balanced bipartite distance of $K_{4}$ -free graphs

Maximum number of points in general position in a random subset of finite $3$ -dimensional spaces