Ce Chen

activity

20242026

collaborators

Showing 2026Show all

2 papers · 1 filter

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

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…