105 citations · 718 across the 103 of their papers we have counts for
5 papers · 2 filters
On the path separation number of graphs
József Balogh, Béla Csaba, Ryan R. Martin +1
A path separator of a graph is a set of paths such that for every pair of edges , there exist paths such t…
Mantel's Theorem for Random Hypergraphs
József Balogh, Jane Butterfield, Ping Hu +1
A classical result in extremal graph theory is Mantel's Theorem, which states that every maximum triangle-free subgraph of is bipartite. A sparse version of Mantel's Theorem…
Hypergraphs with Zero Chromatic Threshold
József Balogh, John Lenz
Let F be an r-uniform hypergraph. The chromatic threshold of the family of F-free, r-uniform hypergraphs is the infimum of all non-negative reals c such that the subfamily of F-fre…
The typical structure of sparse -free graphs
József Balogh, Robert Morris, Wojciech Samotij +1
Two central topics of study in combinatorics are the so-called evolution of random graphs, introduced by the seminal work of Erdős and Rényi, and the family of -free graphs, tha…
Phase transitions in the Ramsey-Turán theory
József Balogh, Ping Hu, Miklós Simonovits
Let be a function and be a graph. Denote by the maximum number of edges of an -free graph on vertices with independence number less than . Er…