13 citations · 49 across the 30 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019★ 10 cited
Making -Free Graphs -partite
József Balogh, Felix Christian Clemen, Mikhail Lavrov +2
The Erdős-Simonovits stability theorem states that for all ε>0 there exists α>0 such that if G is a K_{r+1}-free graph on n vertices with e(G) > ex(n,K_{r+1}) - αn^2, then one can…
math.CO2019
The Ramsey Number of Fano Plane Versus Tight Path
József Balogh, Felix Christian Clemen, Jozef Skokan +1
The hypergraph Ramsey number of two -uniform hypergraphs and , denoted by , is the least integer such that every red-blue edge-coloring of the complete -un…