4 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…
Balanced bipartite distance of -free graphs
József Balogh, Ignacy Buczek, Andrzej Grzesik +1
We show that every -free graph on vertices can be made balanced bipartite by removing at most edges. This proves a conjecture of Balogh, Clemen, and Lidick…
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…
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 , the -uniform hypergraph tight cycle of length . A result of Han, Lo, and Sanhueza-Matamala states that if $\el…