Ce Chen

activity

20242026

collaborators

Showing math.COShow all

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

math.CO2025

Reconstruction of C_4-free graphs from the set of closed neighborhoods and digital convexity

Steffen Borgwardt, MacKenzie Carr, Ce Chen +4

Fomin, KratochvÃl, Lokshtanov, Mancini, and Telle showed that every $C_{4}$ -free graph is reconstructible from the \emph{multiset} of closed neighborhoods. We strengthen their res…

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…

math.CO2024

On the maximum $F$ -free induced subgraphs in $K_{t}$ -free graphs

JÃ³zsef Balogh, Ce Chen, Haoran Luo

For graphs $F$ and $H$ , let $f_{F, H} (n)$ be the minimum possible size of a maximum $F$ -free induced subgraph in an $n$ -vertex $H$ -free graph. This notion generalizes the Ramsey fun…

Bipartite cuts in Ramsey-TurÃ¡n style

Forbidding Exactly One Hamming Distance

Reconstruction of C_4-free graphs from the set of closed neighborhoods and digital convexity

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

On the maximum F-free induced subgraphs in Kt​-free graphs

On the maximum $F$ -free induced subgraphs in $K_{t}$ -free graphs