József Balogh
University of Illinois at Urbana–Champaign
296 Papers
1.6K Citations
József Balogh is an academic researcher from University of Illinois at Urbana–Champaign. The author has contributed to research in topics: Hypergraph & Bipartite graph. The author has an hindex of 36, co-authored 279 publications. Previous affiliations of József Balogh include University of Cambridge & University of California, San Diego.
Chat about Author
Papers
River landscapes and optimal channel networks
Paul Balister,József Balogh,Enrico Bertuzzo,Béla Bollobás,Béla Bollobás,Guido Caldarelli,Amos Maritan,Rossana Mastrandrea,Robert Morris,Andrea Rinaldo +9 more
TL;DR: It is shown that every OCN is a so-called natural river tree, in the sense that there exists a height function such that the flow directions are always directed along steepest descent.
Sharp thresholds in Bootstrap percolation
TL;DR: In this paper, the threshold function of the percolation is shown to be sharp and it is shown that the initial configuration percolates if at the end of the process every site is occupied, while an empty site becomes occupied if at least two of its neighbours are occupied.
Non-degenerate Hypergraphs with Exponentially Many Extremal Constructions
József Balogh,Felix Christian Clemen,Haoran Luo +2 more
- 01 Aug 2022
TL;DR: In this paper , the extremal F t 5 -free hypergraphs are defined as the balanced complete tripartite hypergraph with additional hyperedges inside each of the three parts p V 1, V 2 , V 3 q in the partition.
•Posted Content
Graph bootstrap percolation
TL;DR: In this paper, the authors studied the extremal questions for the model and determined the critical probability for the K-r-process up to a poly-logarithmic factor.
Large Bounded Degree Trees in Expanding Graphs
TL;DR: A slightly weaker version of Haxell's result is proved that a certain family of expanding graphs, which includes very sparse random graphs and regular graphs with large enough spectral gap, contains all almost spanning bounded degree trees.