Ce Chen

collaborators

Showing math.COShow all

3 papers · 1 filter

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

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