# József Balogh

Hungarian mathematician

## József Balogh 's AcademicInfluence.com Rankings

## Download Badge

Mathematics

## József Balogh 's Degrees

- PhD Mathematics Eötvös Loránd University
- Masters Mathematics Eötvös Loránd University

## Why Is József Balogh Influential?

(Suggest an Edit or Addition)According to Wikipedia, József Balogh is a Hungarian-American mathematician, specializing in graph theory and combinatorics. Education and career Balogh grew up in Mórahalom and attended secondary school in Szeged at Ságvári Endre Gyakorló Gimnázium . As a student, he won two silver medals at the International Mathematical Olympiad. He studied at the University of Szeged , where he received his M.S, in mathematics in 1995 with advisor Péter Hajnal and thesis On the existence of MDS-cyclic codes. In 2001 Balogh received his doctorate from the University of Memphis with advisor Béla Bollobás and thesis Graph properties and Bootstrap percolation. As a postdoc Balogh was at AT&T Shannon Laboratories in Florham Park, New Jersey and for several months in 2002 at the Institute for Advanced Study. From 2002 to 2005 he was Zassenhaus Assistant Professor at Ohio State University. At the University of Illinois at Urbana–Champaign he was an assistant professor from 2005 to 2010 and an associate professor from 2010 to 2013 and is since 2013 a full professor. From 2009 to 2011 he was also an associate professor at University of California, San Diego.

## József Balogh 's Published Works

### Published Works

- On k-coverage in a mostly sleeping sensor network (2004) (573)
- On k−coverage in a mostly sleeping sensor network (2008) (189)
- The sharp threshold for bootstrap percolation in all dimensions (2010) (178)
- Bootstrap percolation on the random regular graph (2007) (163)
- Independent sets in hypergraphs (2012) (138)
- Bootstrap percolation on the hypercube (2006) (117)
- Bootstrap Percolation on Infinite Trees and Non-Amenable Groups (2003) (112)
- Bootstrap percolation in three dimensions (2008) (102)
- The Speed of Hereditary Properties of Graphs (2000) (92)
- Random disease on the square grid (1998) (82)
- The Number of Edge Colorings with no Monochromatic Cliques (2004) (79)
- Bootstrap Percolation in High Dimensions (2009) (77)
- The structure of almost all graphs in a hereditary property (2009) (76)
- The number of graphs without forbidden subgraphs (2004) (70)
- Local resilience of almost spanning trees in random graphs (2011) (68)
- Majority Bootstrap Percolation on the Hypercube (2007) (62)
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube (2011) (58)
- Graph bootstrap percolation (2011) (58)
- The typical structure of graphs without given excluded subgraphs (2009) (57)
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle (2014) (52)
- Covering planar graphs with forests (2005) (50)
- The Penultimate Rate of Growth for Graph Properties (2001) (49)
- THE METHOD OF HYPERGRAPH CONTAINERS (2018) (46)
- Large Bounded Degree Trees in Expanding Graphs (2010) (45)
- Linear algebra and bootstrap percolation (2011) (45)
- Hereditary Properties of Ordered Graphs (2007) (45)
- A jump to the bell number for hereditary graph properties (2005) (42)
- The number of Ks,t‐free graphs (2011) (42)
- Tilings in Randomly Perturbed Dense Graphs (2017) (41)
- A remark on the number of edge colorings of graphs (2006) (38)
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles (2014) (38)
- Counting sum-free sets in abelian groups (2012) (38)
- Hereditary properties of partitions, ordered graphs and ordered hypergraphs (2006) (37)
- HAMILTON CYCLES IN RANDOM GEOMETRIC GRAPHS (2009) (36)
- Erdős–Ko–Rado in Random Hypergraphs (2009) (36)
- Sharp bound on the number of maximal sum-free subsets of integers (2014) (35)
- Intersecting families of discrete structures are typically trivial (2014) (33)
- k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn (2004) (33)
- Minimum Number of Monotone Subsequences of Length 4 in Permutations (2014) (33)
- Coloring Some Finite Sets in ℝn (2013) (32)
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs (2018) (32)
- Corrádi and Hajnal's Theorem for Sparse Random Graphs (2012) (31)
- The fine structure of octahedron-free graphs (2011) (31)
- Private computation using a PEZ dispenser (2003) (30)
- Sharp thresholds in Bootstrap percolation (2003) (30)
- TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM (2015) (30)
- Unavoidable Traces Of Set Systems (2005) (29)
- River landscapes and optimal channel networks (2018) (27)
- Packing chromatic number of cubic graphs (2018) (27)
- Game domination number (2002) (26)
- Edit Distance and its Computation (2008) (26)
- On Avoider-Enforcer Games (2016) (25)
- The typical structure of sparse $K_{r+1}$-free graphs (2013) (25)
- A refinement of the Cameron–Erdős conjecture (2012) (25)
- Excluding induced subgraphs: Critical graphs (2011) (24)
- Triangle factors of graphs without large independent sets and of weighted graphs (2016) (24)
- Rainbow triangles in three-colored graphs (2014) (23)
- A random version of Sperner's theorem (2014) (23)
- On the Ramsey-Turán numbers of graphs and hypergraphs (2011) (22)
- Measures on monotone properties of graphs (2002) (22)
- An extended lower bound on the number of (k)-edges to generalized configurations of points and the pseudolinear crossing number of Kn (2008) (22)
- The unlabelled speed of a hereditary graph property (2009) (22)
- Hereditary Properties of Tournaments (2007) (22)
- On the number of points in general position in the plane (2017) (21)
- Some exact Ramsey–Turán numbers (2011) (21)
- The Erdos-Lovász Tihany conjecture for quasi-line graphs (2009) (21)
- Hereditary properties of words (2005) (21)
- The number of Km,m-free graphs (2011) (21)
- The number of subsets of integers with no $k$-term arithmetic progression (2016) (20)
- The number of the maximal triangle‐free graphs (2014) (20)
- The Typical Structure of Gallai Colorings and Their Extremal Graphs (2018) (20)
- Packing Chromatic Number of Subdivisions of Cubic Graphs (2018) (20)
- Almost all triple systems with independent neighborhoods are semi-bipartite (2010) (19)
- Hereditary properties of combinatorial structures: Posets and oriented graphs (2007) (18)
- Large minors in graphs with given independence number (2011) (18)
- Almost all triangle-free triple systems are tripartite (2012) (17)
- THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS (2015) (17)
- Index assignment for two-channel quantization (2004) (17)
- On the First-Fit Chromatic Number of Graphs (2008) (17)
- The Turan Density of Triple Systems Is Not Principal (2002) (17)
- On the Tree Packing Conjecture (2012) (17)
- The diameter game (2009) (17)
- Rainbow spanning trees in properly coloured complete graphs (2017) (17)
- The Klee–Minty random edge chain moves with linear speed (2005) (17)
- Triangle-Tilings in Graphs Without Large Independent Sets (2016) (16)
- The number of hypergraphs without linear cycles (2017) (16)
- The typical structure of graphs with no large cliques (2014) (16)
- The typical structure of intersecting families of discrete structures (2014) (15)
- Graphs Having Small Number of Sizes on Induced k-Subgraphs (2007) (15)
- Packing chromatic number of subcubic graphs (2017) (15)
- Random sum-free subsets of abelian groups (2011) (15)
- On the Chvátal-Erdös Triangle Game (2011) (14)
- On Perfect Packings in Dense Graphs (2011) (14)
- Applications of graph containers in the Boolean lattice (2016) (14)
- Long Monotone Paths in Line Arrangements (2003) (14)
- Large convex holes in random point sets (2012) (14)
- Disjoint representability of sets and their complements (2005) (14)
- Online Ramsey games for triangles in random graphs (2010) (14)
- Sizes of Induced Subgraphs of Ramsey Graphs (2009) (13)
- Structure and Supersaturation for Intersecting Families (2018) (13)
- Complete minors, independent sets, and chordal graphs (2009) (12)
- Phase transitions in Ramsey-Turán theory (2013) (12)
- On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs (2006) (12)
- Independent sets in the middle two layers of Boolean lattice (2020) (11)
- Hypergraph Turán Problems in `2-Norm (2021) (10)
- The convex hull of every optimal pseudolinear drawing of Kn is a triangle (2007) (10)
- An efficient container lemma (2019) (10)
- Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs (2017) (10)
- On the number of linear hypergraphs of large girth (2017) (10)
- Transitive triangle tilings in oriented graphs (2014) (9)
- Further applications of the Container Method (2016) (9)
- A discrepancy version of the Hajnal-Szemerédi theorem (2020) (9)
- On the Discrepancies of Graphs (2020) (9)
- Making Kr+1-free graphs r-partite (2019) (8)
- A new short proof of a theorem of Ahlswede and Khachatrian (2008) (8)
- Subdivisions of a large clique in C6-free graphs (2013) (8)
- On the edge-bandwidth of graph products (2006) (8)
- Closing in on Hill's Conjecture (2017) (8)
- An Upper Bound on the Size of Sidon Sets (2021) (7)
- Kleitman's conjecture about families of given size minimizing the number of $k$-chains (2016) (7)
- Book Embeddings of Regular Graphs (2015) (7)
- On the bandwidth of 3-dimensional Hamming graphs (2008) (6)
- Cubic Graphs with Small Independence Ratio (2017) (6)
- Long monochromatic paths and cycles in 2-edge-colored multipartite graphs (2019) (6)
- A sharp edge bound on the interval number of a graph (1999) (6)
- Solving Turán’s Tetrahedron Problem for the `2-Norm (2021) (6)
- Mantel's theorem for random hypergraphs (2013) (6)
- Partitioning edge-2-colored graphs by monochromatic paths and cycles (2012) (6)
- On the Chromatic Thresholds of Hypergraphs (2011) (5)
- Lower bounds on the Erdős–Gyárfás problem via color energy graphs (2023) (5)
- On ( ≤ k ) – pseudoedges in generalized configurations and the pseudolinear crossing number of K n B (2006) (5)
- Almost All C4-Free Graphs Have Fewer than (1-epsilon), ex(n, C4) Edges (2010) (5)
- On the number of union-free families (2016) (5)
- Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree (2020) (5)
- Stability for Vertex Cycle Covers (2017) (5)
- Ordered size Ramsey number of paths (2018) (5)
- An analogue of the Erdős-Gallai theorem for random graphs (2020) (5)
- Almost all cancellative triple systems are tripartite (2009) (5)
- The Positive Minimum Degree Game on Sparse Graphs (2012) (5)
- Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree (2019) (4)
- On the path separation number of graphs (2013) (4)
- Monochromatic connected matchings in 2‐edge‐colored multipartite graphs (2019) (4)
- Almost all C 4-free graphs have fewer than ( 1 − ε ) ex ( n , C 4 ) edges (2010) (4)
- Short proofs of three results about intersecting systems (2021) (4)
- Max Cuts in Triangle-Free Graphs (2021) (4)
- On 2-Detour Subgraphs of the Hypercube (2008) (4)
- Intersecting families of sets are typically trivial (2021) (4)
- On the variance of Shannon products of graphs (2008) (4)
- Counting independent sets in regular hypergraphs (2020) (3)
- Families in posets minimizing the number of comparable pairs (2017) (3)
- An improved lower bound for Folkman's theorem (2017) (3)
- On the interval number of special graphs (2004) (3)
- The domination number of the graph deﬁned by two levels of the n -cube, II (2020) (3)
- Ramsey upper density of infinite graph factors (2020) (3)
- On Two Problems in Ramsey-Turán Theory (2016) (3)
- Rainbow copies of C4 in edge-colored hypercubes (2016) (3)
- Two results about the hypercube (2017) (3)
- Near―perfect non-crossing harmonic matchings in randomly labeled points on a circle (2005) (2)
- Tilings in vertex ordered graphs (2020) (2)
- On the number of K4-saturating edges (2014) (2)
- On stability of the Erdős–Rademacher problem (2020) (2)
- Maximal $3$-wise intersecting families (2021) (2)
- Almost all C 4-free graphs have less than ( 1 − ε ) ex ( n , C 4 ) edges (2009) (2)
- Counting sum-free sets in abelian groups (2013) (2)
- Towards a Weighted Version of the Hajnal–Szemerédi Theorem (2012) (2)
- Rainbow connectivity of randomly perturbed graphs (2021) (2)
- Long rainbow arithmetic progressions (2019) (2)
- The Spectrum of Triangle-free Graphs (2022) (2)
- Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position (2007) (2)
- A note on harmonic subgraphs in labelled geometric graphs (2008) (2)
- A Parallelized Sequential Random Search Global Optimization Algorithm (1999) (2)
- A general law of large permanent (2017) (2)
- An extension of Dirac ’ s Theorem (2015) (2)
- Minimum Difference Representations of Graphs (2009) (2)
- Maximum number of almost similar triangles in the plane (2021) (2)
- A sharp bound on the number of maximal sum-free sets (2015) (2)
- Nearly all k-SAT functions are unate (2022) (1)
- Ramsey-Tur\'an Problems with small independence numbers (2022) (1)
- Hypergraphs with Zero Chromatic Threshold (2013) (1)
- Maximal 3-wise Intersecting Families with Minimum Size: the Odd Case (2022) (1)
- On the number of $K_4$-saturating edges (2013) (1)
- Turán Densities of Some Hypergraphs Related to Kk+1k (2012) (1)
- Extremal and Probabilistic Combinatorics January 23 rd – January (2013) (1)
- Sharp threshold for the Erdős–Ko–Rado theorem (2021) (1)
- Chain method for panchromatic colorings of hypergraphs (2020) (1)
- Packing Chromatic Number of Subdivisions of Cubic Graphs (2019) (1)
- On stability of the Erd\H{o}s-Rademacher Problem (2020) (1)
- Solving Turán's tetrahedron problem for the ℓ2$\ell _2$ ‐norm (2021) (1)
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles (2014) (1)
- C O ] 2 1 N ov 2 01 9 The domination number of the graph defined by two levels of the ncube , II (2019) (1)
- A sharp threshold for a random version of Sperner's Theorem (2022) (1)
- Non-degenerate Hypergraphs with Exponentially Many Extremal Constructions (2022) (1)
- The interval number of dense graphs (2002) (1)
- Generalized rainbow Turán numbers of odd cycles (2020) (1)
- The maximum length of $K_r$-bootstrap percolation (2019) (1)
- An analogue of the Erd\H{o}s-Gallai theorem for random graphs (2019) (1)
- On the sizes of large subgraphs of the binomial random graph (2019) (1)
- Monochromatic Hilbert Cubes and Arithmetic Progressions (2018) (1)
- A strengthening of the Erdős-Szekeres Theorem (2022) (1)
- Improved Bounds for the Number of ( n . (2004) (1)
- On the number of generalized Sidon sets (2018) (1)
- Transference for the Erd\H{o}s-Ko-Rado theorem (2016) (1)
- Maximum determinant and permanent of sparse 0-1 matrices (2020) (0)
- Short proofs of two results about intersecting set systems (2021) (0)
- Random sum-free subsets of abelian groups (2013) (0)
- Gráfok, geometria, véletlen, algoritmusok = Graphs, geometry, randomness, algorithms (2009) (0)
- Empty convex polytopes in random point sets (2013) (0)
- Phase transitions in RamseyTurán theory (2015) (0)
- LARGE MINORS IN GRAPHS WITH A GIVEN STABILITY NUMBER (2011) (0)
- C O ] 1 1 M ay 2 01 8 Tilings in randomly perturbed dense graphs (2018) (0)
- Hypergraphs with Zero Chromatic Threshold (2015) (0)
- Tur´an densities of some hypergraphs related to K kk +1 ∗ (2013) (0)
- On oriented cycles in randomly perturbed digraphs (2022) (0)
- On the Ramsey-Turán numbers of graphs and hypergraphs (2012) (0)
- The asymptotic behavior of the covering number of a graph on two layers of the Boolean lattice (2019) (0)
- Submitted to the Annals of Applied Probability HAMILTON CYCLES IN RANDOM GEOMETRIC GRAPHS By (2010) (0)
- New Lower Bounds For Essential Covers Of The Cube (2022) (0)
- Mathematisches Forschungsinstitut Oberwolfach Report No . 20 / 2007 Mini-Workshop : Positional Games Organised (2007) (0)
- Phase transitions in the Ramsey-Tur\'an theory (2013) (0)
- Almost all triangle-free triple systems are tripartite (2012) (0)
- C O ] 2 J un 2 01 6 On the path separation number of graphs (2017) (0)
- Proper elements of Coxeter groups (2021) (0)
- On the non-existence of cyclic MDS codes (1998) (0)
- On the Number of Sum-Free Triplets of Sets (2021) (0)
- The Ramsey Number of Fano Plane Versus Tight Path (2019) (0)
- On the sizes of $t$-intersecting $k$-chain-free families (2022) (0)
- Weighted Tur\'an theorems with applications to Ramsey-Tur\'an type of problems (2023) (0)
- On the number of union-free families (2017) (0)
- On the Decay of Crossing Numbers of Sparse Graphs (2012) (0)
- Workshop: Combinatorics, Probability and Computing Table of Contents (2006) (0)
- COLORINGS AND LIST COLORINGS OF GRAPHS AND HYPERGRAPHS BY MOHIT KUMBHAT DISSERTATION (2012) (0)
- Hypergraph Tur\'an Problems in $\ell_2$-Norm (2021) (0)
- 10 Problems for Partitions of Triangle-free Graphs (2022) (0)
- Lower bounds on the Erd\H{o}s-Gy\'arf\'as problem via color energy graphs (2021) (0)
- The Klee-Minty random edge chain moves with bounded speed (2005) (0)
- C O ] 2 1 M ar 2 01 4 INDEPENDENT SETS IN HYPERGRAPHS (2021) (0)
- On the Maximum $F_5$-free Subhypergraphs of a Random Hypergraph (2022) (0)
- Counting r-graphs without forbidden configurations (2021) (0)
- On Generalized Turán Results in Height Two Posets (2021) (0)
- Unavoidable order-size pairs in hypergraphs -- positive forcing density (2022) (0)
- Corr\'adi and Hajnal's theorem for sparse random graphs (2010) (0)
- Almost Congruent Triangles (2023) (0)
- PR ] 1 4 Ju l 2 01 0 BOOTSTRAP PERCOLATION IN HIGH DIMENSIONS (2021) (0)
- Exact crossing numbers (2019) (0)
- Tur\'an density of long tight cycle minus one hyperedge (2023) (0)
- University of Birmingham Tilings in randomly perturbed dense graphs (2018) (0)
- A Strengthening of the Erd\H{o}s-Szekeres Theorem (2020) (0)
- Maximum density of induced C 5 is achieved by an 1 iterated blow-up of C 5 2 (2014) (0)
- A SHORT PROOF OF A VARIANT OF THE HYPERGRAPH CONTAINER LEMMA FOR 3-UNIFORM HYPERGRAPHS (2019) (0)
- Maximum induced subgraphs of the binomial random graph (2019) (0)
- C O ] 1 5 N ov 2 01 4 Subdivisions of a large clique in C 6-free graphs (2018) (0)
- The typical structure of graphs with no large cliques (2016) (0)

This paper list is powered by the following services:

## Other Resources About József Balogh

## What Schools Are Affiliated With József Balogh ?

József Balogh is affiliated with the following schools: