6 papers · 1 filter
Bipartite cuts in Ramsey-Turán style
József Balogh, Ce Chen, Bernard Lidický
We prove that every -free -vertex graph with sublinear independence number can be made bipartite by removing at most edges, where the constant is be…
Forbidding Exactly One Hamming Distance
József Balogh, Ce Chen, Bowen Li
Addressing questions raised in recent papers, we study the -distance graph on the Boolean cube , where two vertices are adjacent if their Hamming distance is…
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 -free graph is reconstructible from the \emph{multiset} of closed neighborhoods. We strengthen their resu…
Maximal independent sets in the middle two layers of the Boolean lattice
József Balogh, Ce Chen, Ramon I. Garcia
Let be the subgraph of the hypercube induced by its two largest layers. Duffus, Frankl and Rödl proposed the problem of finding the asymptotics fo…
On the maximum -free induced subgraphs in -free graphs
József Balogh, Ce Chen, Haoran Luo
For graphs and , let be the minimum possible size of a maximum -free induced subgraph in an -vertex -free graph. This notion generalizes the Ramsey fun…
On the Constructor-Blocker Game
József Balogh, Ce Chen, Sean English
In the Constructor-Blocker game, two players, Constructor and Blocker, alternatively claim unclaimed edges of the complete graph . For given graphs and , Constructor ca…