World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
38
Citations
6338
World Ranking
10209
National Ranking
4291

Mathematics

D-Index
38
Citations
6382
World Ranking
2333
National Ranking
987

Overview

József Balogh is affiliated with the University of Illinois at Urbana-Champaign in the United States. Their research predominantly spans the fields of Mathematics and Computer Science, with a strong focus on areas within Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Mathematical Physics, and Electrical and Electronic Engineering.

The scientist's work engages extensively with graph theory and related mathematical structures. Key topics covered in their publications include:

  • Limits and Structures in Graph Theory
  • Advanced Graph Theory Research
  • Graph theory and applications
  • Advanced Topology and Set Theory
  • graph theory and CDMA systems
  • Graph Labeling and Dimension Problems
  • Stochastic processes and statistical mechanics

The publication record of József Balogh includes journal articles and conference papers in several prominent venues. Among the frequent publication venues are:

  • arXiv (Cornell University)
  • Journal of Graph Theory
  • European Journal of Combinatorics
  • SIAM Journal on Discrete Mathematics
  • Combinatorics Probability Computing

Some of the recent published papers by Balogh include the following:

  • Independent sets in the middle two layers of Boolean lattice, 2020, Journal of Combinatorial Theory Series A
  • An Upper Bound on the Size of Sidon Sets, 2023, American Mathematical Monthly
  • Making Kr+1-free graphs r-partite, 2020, Combinatorics Probability Computing
  • Long monochromatic paths and cycles in 2-edge-colored multipartite graphs, 2020, Moscow Journal of Combinatorics and Number Theory
  • Solving Turán's tetrahedron problem for the ℓ2-norm, 2022, Journal of the London Mathematical Society

Collaboration is a significant aspect of their work. Frequent co-authors include:

  • Felix Christian Clemen
  • Bernard Lidický
  • Lina Li
  • Robert A. Krueger
  • Haoran Luo

Best Publications

  • On k-coverage in a mostly sleeping sensor network

    Santosh Kumar;Ten H. Lai;József Balogh

  • Independent sets in hypergraphs

    József Balogh;Robert Morris;Wojciech Samotij

  • The sharp threshold for bootstrap percolation in all dimensions

    József Balogh;Béla Bollobás;Hugo Duminil-Copin;Robert Morris

  • Bootstrap percolation on the random regular graph

    József Balogh;Boris G. Pittel

  • Bootstrap percolation on the hypercube

    József Balogh;Béla Bollobás;Béla Bollobás

  • Bootstrap Percolation on Infinite Trees and Non-Amenable Groups

    József Balogh;Yuval Peres;Gábor Pete

  • The Speed of Hereditary Properties of Graphs

    József Balogh;Béla Bollobás;David Weinreich

  • Bootstrap percolation in three dimensions

    József Balogh;Béla Bollobás;Béla Bollobás;Robert Morris

  • Random disease on the square grid

    József Balogh;József Balogh;Gábor Pete

  • THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES

    Noga Alon;Noga Alon;József Balogh;Peter Keevash;Benny Sudakov;Benny Sudakov

  • The number of graphs without forbidden subgraphs

    József Balogh;Béla Bollobás;Miklós Simonovits

  • Bootstrap percolation in high dimensions

    JÓzsef Balogh;BÉla BollobÁs;Robert Morris

  • The structure of almost all graphs in a hereditary property

    Noga Alon;József Balogh;Béla Bollobás;Robert Morris

  • A jump to the bell number for hereditary graph properties

    József Balogh;Béla Bollobás;David Weinreich

  • Local resilience of almost spanning trees in random graphs

    József Balogh;Béla Csaba;Wojciech Samotij

  • The number of Ks,t‐free graphs

    József Balogh;Wojciech Samotij

  • Majority bootstrap percolation on the hypercube

    JÓzsef Balogh;BÉla BollobÁs;Robert Morris

  • Graph bootstrap percolation

    József Balogh;Béla Bollobás;Robert Morris

  • Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube

    József Balogh;Ping Hu;Bernard Lidický;Bernard Lidický;Hong Liu

  • Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle

    József Balogh;Ping Hu;Bernard Lidický;Florian Pfender

  • Covering planar graphs with forests

    József Balogh;Martin Kochol;András Pluhár;Xingxing Yu

Frequent Co-Authors

Béla Bollobás
Béla Bollobás University of Memphis
Alexandr V. Kostochka
Alexandr V. Kostochka University of Illinois at Urbana-Champaign
Noga Alon
Noga Alon Tel Aviv University
Dhruv Mubayi
Dhruv Mubayi University of Illinois at Chicago
Miklós Simonovits
Miklós Simonovits Alfréd Rényi Institute of Mathematics
Boris Pittel
Boris Pittel The Ohio State University
Benny Sudakov
Benny Sudakov ETH Zurich
Mario Szegedy
Mario Szegedy Rutgers, The State University of New Jersey
Oded Regev
Oded Regev Courant Institute of Mathematical Sciences
Andrea Rinaldo
Andrea Rinaldo École Polytechnique Fédérale de Lausanne

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students interested in expanding their career opportunities beyond Mathematics, pursuing online degrees such as an MBA can be a strategic move. Many candidates seek the fastest online MBA programs to quickly enhance their leadership and business skills without putting their careers on hold.

Cost is often a major factor when considering further education. For those drawn to marketing applications in tech or analytics, an ms in digital marketing degree cost tuition fees can provide clarity on affordable options that still offer strong ROI through increased earnings.

Additionally, the availability of cheapest 1 year online MBA programs creates opportunities for efficient, cost-effective study plans. These accelerated pathways allow graduates to enter the workforce sooner while acquiring valuable business acumen.

Many programs also accept transfer credits, giving prospective students flexibility and credit for prior coursework. Exploring mba transfer credits policies can save time and money, ensuring a smoother transition into advanced degree programs.

Best Scientists Citing József Balogh

Trending Scientists

Recently Published Articles