Publications
Papers in this color solve an Erdos Conjecture. Papers in this color give current best result on an Erdos Conjecture
Preprints
Noga Alon, József Balogh, Vladimir N. Potapov: Partitioning the hypercube into smaller hypercubes. https://arxiv.org/abs/2401.00299.
Jozsef Balogh, Ethan Patrick White: Grid-drawings of graphs in three-dimensions.
József Balogh, Ramon I. Garcia, and Michael C. Wigal: On the number of P-free set systems for tree posets P.
József Balogh, Van Magnan, Cory Palmer: Generalized Ramsey-Turán Numbers.
József Balogh, Ce Chen, Sean English: On the Constructor-Blocker Game.https://arxiv.org/abs/2401.00386.
József Balogh, Suyun Jiang, Haoran Luo: On the maximum number of r-cliques in graphs free of complete r-partite subgraphs. arXiv:2402.16818
József Balogh, The Nguyen, Patric R. J. Ostergard, Ethan Patrick White, Michael Wigal, Improving Uniquely Decodable Codes in Binary Adder Channels. arXiv:2312.11723
József Balogh, Domagoj Bradač, Bernard Lidický, Weighted Turán theorems with applications to Ramsey-Turán type of problems. arXiv:2302.07859.
József Balogh, Dingding Dong, Bernard Lidický, Nitya Mani, Yufei Zhao, Nearly all k-SAT functions are unate. Association for Computing Machinery (ACM), New York, 2023, 958--962.
József Balogh, Felix Christian Clemen, Haoran Luo, Non-degenerate Hypergraphs with Exponentially Many Extremal Constructions.
J. Balogh, F. C. Clemen, B. Lidický, Max Cuts in Triangle-free Graphs, Eurocomb version published, journal version is still in preparation.
To appear
József Balogh, Haoran Luo, Turán density of long tight cycle minus one hyperedge. Combinatorica, arXiv:2303.10530.
J. Balogh, G. Kronenberg, A. Pokrovskiy, T. Szabo, The maximum length of K_r-Bootstrap Percolation, to appear, Proc. of AMS.
József Balogh, Robert A. Krueger, A sharp threshold for a random version of Sperner's Theorem, Random Structure and Algorithm.
József Balogh, Felix Christian Clemen, Adrian Dumitrescu, Almost Congruent Triangles. Discrete & Computational Geometry, arXiv:2303.14663.
József Balogh, Felix Christian Clemen, Adrian Dumitrescu, On a Traveling Salesman Problem for Points in the Unit Cube. Algorithmica, arXiv:2310.02839.
J. Balogh, W. Linz, Short proofs of three results about intersecting systems, Combinatorial Theory.
József Balogh, Andrew Treglown, Camila Zárate-Guerén: A note on colour-bias perfect matchings in hypergraphs. SIAM DM.
József Balogh, Anita Liebenau, Letícia Mattos, Natasha Morrison: On multicolor Turán numbers. https://arxiv.org/abs/2402.05060, SIAM DM.
József Balogh, John Finlay, Cory Palmer, Rainbow connectivity of randomly perturbed graphs, J. Graph Theory.
József Balogh, Felix Christian Clemen, Bernard Lidický, 10 Problems for Partitions of Triangle-free Graphs, European Journal of Combinatorics (special issue of Eurocomb 2021).
Igor Araujo, József Balogh, Letícia Mattos, New Lower Bounds For Essential Covers Of The Cube. Israel J. Math.
2024 [180--18. ]
J. Balogh, R. I. Garcia, Lina Li, A. Zs. Wagner, Intersecting families of sets are typically trivial. J. Comb. Theory B. Volume 164, January 2024, Pages 44--67.
Igor Araujo, József Balogh, Robert A. Krueger, Simón Piga, Andrew Treglown, On oriented cycles in randomly perturbed digraphs. Combinatorics, Probability and Computing. 33 (2024), no. 2, 157--178.
József Balogh, David Brewster, Reuven Hodges, Proper elements of Coxeter Groups, European Journal of Combinatorics. 10 (2024), no. 2, Paper No. 32.
Balogh, József; Chen, Ce; McCourt, Grace; Murley, Cassie: Ramsey–Turán problems with small independence numbers, European J. Combin. 118 (2024), Paper No. 103872.
2023 [170--179]
J. Balogh, R. A. Krueger, Haoran Luo, Sharp threshold for the Erdős-Ko-Rado theorem, Random Structures & Algorithms, 62 (2023), no. 1, 3--28.
J. Balogh, Z. Füredi, S. Roy, An upper bound on the size of Sidon sets, American Mathematical Monthly. 130 (2023), no. 5, 437--445.
József Balogh, Felix Christian Clemen, Bernard Lidický, Sergey Norin, Jan Volec, The Spectrum of Triangle-free Graphs, SIAM J. Discrete Math. 37 (2023), no. 2, 1173--1179.
József Balogh, William B. Linz, Balázs Patkós, On the sizes of t-intersecting k-chain-free families, Combinatorial Theory. 3 (2023), no. 2, Paper No. 13, 14 pp.
József Balogh, Ce Chen, Kevin Hendrey, Ben Lund, Haoran Luo, Casey Tompkins, Tuan Tran, Maximal 3-wise Intersecting Families. Combinatorica. 43 (2023), no. 6, 1045–1066. Note that it is a result of merging our paper with the rest of the authors paper: József Balogh, Ce Chen, Haoran Luo: Maximal 3-wise Intersecting Families with Minimum Size: the Odd Case. arXiv:2206.09334.
Igor Araujo, József Balogh, Haoran Luo, On the Maximum F_5-free Subhypergraphs of a Random Hypergraph, Electronic J. Combinatorics. 30 (2023) P4.22.
J. Balogh, S. English, E. Heath, R. A. Krueger, Lower bounds on the Erdős-Gyárfás problem via color energy graphs, J. Graph Theory. 103 (2023), no. 2, 378--409.
Maria Axenovich, József Balogh, Felix Christian Clemen, Lea Weber, Unavoidable order-size pairs in hypergraphs -- positive forcing density. Combinatorial Theory. 3 (2023), no. 3, Paper No. 15, 17 pp.
J. Balogh, A. Lamaison, Ramsey upper density of infinite graph factors, Illinois J. Math. 67 (2023), no. 1, 171--184.
J. Balogh and F. C. Clemen, On stability of the Erdos--Rademacher Problem, Illinois J. Math. 67 (2023), no. 1, 1--11.
2022 [157--169]
J. Balogh, F. C. Clemen, B. Lidický, Hypergraph Turán Problems in ℓ_2-Norm, Surveys in combinatorics 2022, 21--63, London Math. Soc. Lecture Note Ser., 481, Cambridge Univ. Press, Cambridge, 2022.
J. Balogh, F. C. Clemen, B. Lidický, Solving Turán's Tetrahedron Problem for the ℓ_2-Norm, J. London Mathematics Soc 106 (2022), no. 1, 60--84.
József Balogh, Felix Christian Clemen, Bernard Lidický, Maximum Number of Almost Similar Triangles in the Plane, Comput. Geom. 105 (2022), Paper No. 101880, 15 pp.
J. Balogh, F. C. Clemen, L. Mattos, Counting r-graphs without forbidden configurations, J. Combin. Theory Ser. B 157 (2022), 216--234.
Igor Araujo, József Balogh, Yuzhou Wang, Maximum determinant and permanent of sparse 0-1 matrices, Linear Algebra Appl. 645 (2022), 194–228.
J. Balogh, Lina Li, A. Treglown, Tilings in vertex ordered graphs, J. Combin. Theory Ser. B 155 (2022), 171–201.
J. Balogh, A. Kostochka, M. Lavrov, X. Liu, Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree, Combin. Probab. Comput. 31 (2022), no. 1,109--122.
J. Balogh, A. Kostochka, M. Lavrov, X. Liu, Monochromatic connected matchings in 2-edge-colored multipartite graphs, J. Graph Theory, 100 (2022), no. 3, 578--607.
József Balogh, Ryan R. Martin, Dániel T. Nagy, Balázs Patkós, On generalized Turán results in height two posets, SIAM J. Discrete Math. 36 (2022), no. 2, 1483--1495.
J. Balogh, M. Zhukovskii, On the sizes of large subgraphs of the binomial random graph, Discrete Math. 345 (2022), no. 2, Paper No. 112675.
Margarita Akhmejanova, József Balogh, Dmitry Shabanov, Chain method for panchromatic colorings of hypergraphs, Discrete Appl. Math. 321 (2022), 72--81.
J. Balogh, F. C. Clemen, E. Heath, M. Lavrov, A Strengthening of the Erdős-Szekeres Theorem, European J. Combin. 101 (2022), Paper No. 103456, 12 pp.
J. Balogh, M. Delcourt, E. Heath, Lina Li, Generalized rainbow Turán numbers of odd cycles , Discrete Math. 345 (2022), Paper No. 112663.
2021 [147--156]
J. Balogh, R. I. Garcia, and Lina Li, Independent sets in middle two layers of Boolean lattice, J. Combin. Theory Ser. A 178 (2021), Paper No. 105341, 24pp.
J. Balogh, B. Bollobas, and B. Narayanan, Counting independent sets in regular hypergraphs, Counting independent sets in regular hypergraphs. J. Combin. Theory Ser. A 180 (2021), Paper No. 105405, 5 pp.
J. Balogh, B. Csaba, A. Pluhar, A. Treglown, A discrepancy version of the Hajnal--Szemer\'edi theorem, Combin. Probab. Comput. 30 (2021), no. 3, 444–459.
J. Balogh and Lina Li, On the number of generalized Sidon sets, Acta Sci. Math. (Szeged) 87 (2021), no. 1-2, 3--21.
J. Balogh, F. C. Clemen, M. Lavrov, B. Lidicky, and F. Pfender, Making $K_{r+1}$-Free Graphs $r$-partite, Combin. Probab. Comput. 30 (2021), no. 4, 609--618.
J. Balogh, N. Lemons, and C. Palmer, Maximum size intersecting families of bounded minimum positive co-degree, SIAM J. Discrete Math. 35 (2021), no. 3, 1525–1535.
J. Balogh, W. Linz, L. Mattos, Long rainbow arithmetic progressions, Journal of Combinatorics, 12(2021), no.3, 547--550.
J. Balogh, A. Dudek, and Lina Li, An analogue of the Erdos-Gallai theorem for random graphs, European J. Combin. 91 (2021), Paper No. 103200, 11 pp.
J. Balogh, Gy. O. H. Katona, W. Linz, and Zs. Tuza, The domination number of the graph defined by two levels of the n-cube, II European J. Combin. 91 (2021), Paper No. 103201, 10 pp.
Igor Araujo, József Balogh, Ramon I. Garcia, On the number of sum-free triplets of sets, Electron. J. Combin. 28 (2021), Paper No. 4.36, 17 pp.
2020 [140--146 ]
J. Balogh and W. Samotij, An efficient container lemma, Discrete Anal., 2020, Paper No. 17, 56 pp.
J. Balogh, A. Kostochka, M. Lavrov, X. Liu, Long monochromatic paths and cycles in 2-edge-colored multipartite graphs, Mosc. J. Comb. Number Theory, 9 (2020), no. 1, 55--100.
J. Balogh and Lina Li, On the number of linear hypergraphs of large girth, J. Graph Theory, 93 (2020), no. 1, 113--141.
J. Balogh, F. C. Clemen, E. Heath, M. Lavrov, Ordered Size Ramsey Number of Paths, Discrete Applied Mathematics,
276 (2020), 13--18.
J. Balogh, F. C. Clemen, J. Skokan, A. Zs. Wagner, The Ramsey Number of Fano Plane Versus Tight Path, Electron. J. Combin. 27 (2020), no. 1, 16 pp.
J. Balogh, S. Petrickova, A. Zs. Wagner, Families in posets minimizing the number of comparable pairs, J. Graph Theory 95 (2020), no. 4, 655–676.
J. Balogh, B. Csaba, Y. Jing, A. Pluhar, On the discrepancies of graphs, Electron. J. Combin. 27 (2020), no. 2, 12, 14 pp.
2019 [131-- 140 ]
J. Balogh, B. Narayanan and J. Skokan, The number of hypergraphs without linear cycles, J. Combin. Theory Ser. B 134 (2019), 309--321.
J. Balogh, B. Lidicky, and G. Salazar, Closing in on Hill's conjecture, SIAM J. Discrete Math. 33 (2019), no. 3, 1261–1276.
J. Balogh, and L. Li, The typical structure of Gallai colorings and their extremal graphs, SIAM J. Discrete Math., 33 (2019), no. 4, 2416--2443.
J. Balogh and T. Molla, Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs, European J. Combin. 79 (2019), 140--151.
J. J. Balogh, D. Cherkasin, S. Kiselev, Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs, European J. Combin. 79 (2019), 228--236.
J. Balogh, M. Lavrov, G. Shakan, and A. Zs. Wagner, Monochromatic Hilbert cubes and arithmetic progressions, Electronic J. of Combinatorics, 26 (2019), no. 2, Paper 2.22, 15 pp.
J. Balogh, A. Treglown, and A. Zs. Wagner, Tilings in randomly perturbed dense graphs, Combinatorics, Probability and Computing. 28 (2019), no. 2, 159--176.
J. Balogh, S. Das, H. Liu, M. Sharifzadeh, and Tuan Tran, Structure and Supersaturation for Intersecting Families, Electron. J. Combin. 26 (2019), no. 2, Paper 2.34, 38 pp.
J. Balogh, A. Kostochka, and Xujun Liu, Packing chromatic number of subdivisions of cubic graphs, Graphs Combin. 35 (2019), no. 2, 513--537.
J. Balogh, A. Kostochka, and Xujun Liu, Cubic graphs with small independence ratio, Electron. J. Combin. 26 (2019), no. 1, Paper 1.43, 22 pp.
2018 [122--130]
J. Balogh, R. Morris, and W. Samotij The method of hypergraph containers, Proceedings of the International Congress of Mathematicians–Rio de Janeiro 2018. Vol. 3, pp. 3045--3078.
J. Balogh and J. Solymosi, On the number of points in general position in the plane, Discrete Analysis (2018), Paper No. 16, 20 pp.
J. Balogh, Hong Liu, M. Sharifzadeh, and A. Treglown, Sharp bound on the number of maximal sum-free subsets of integers. J. Eur. Math. Soc. (JEMS) 20 (2018), no. 8, 1885--1911.
J. Balogh and A. Zs. Wagner, Kleitman's conjecture about families of given size minimizing the number of k-chains, , Advances in Mathematics, 330 (2018), 229--252.
P. Balister, J. Balogh, E. Bertuzzo, B. Bollobas, G. Caldarelli, A. Maritan, R. Mastrandrea, R. Morris, A Rinaldo River landscapes and Optimal Channel Networks, Proceeding of the National Academy of Sciences U.S.A., 115 6548--6553 (2018)
J. Balogh, A. McDowell, T. Molla, and R. Mycroft, Triangle-tilings in graphs without large independent sets , Combinatorics, Probability and Computing,
27 (2018), no. 4, 449--474. J. Balogh, A. Kostochka, and Xujun Liu, Packing chromatic number of subcubic graphs, Discrete Mathematics, 341 (2018), no. 2, 474--483.
J. Balogh, T. Meszaros, and A. Zs. Wagner, Two results about the hypercube, Discrete Applied Mathematics. 247 (2018), 322--326.
J. Balogh, Hong Liu, R. Montgomery, Rainbow spanning trees in properly coloured complete graphs, Discrete Applied Mathematics. 247 (2018), 97--101.
2017 [113-- 121 ]
J. Balogh, S. Eberhard, B. Narayanan, A. Treglown and A. Zs. Wagner, An improved lower bound for Folkman's Theorem , Bull. London. Math. Soc. 49 (2017), no. 4, 745–747.
J. Balogh, Hong Liu, and M. Sharifzadeh, The number of subsets of integers with no k term arithmetic progression, International Mathematics Research Notices, 2017, no. 20, 6168--6186.
J. Balogh and A. Zs. Wagner, On the number of union-free families, Israel J. Mathematics, 219 (2017) 1, 431--448.
J. Balogh, A. Lo, and T. Molla, Transitive Triangle Tilings in Oriented Graphs, Transitive triangle tilings in oriented graphs. J. Combin. Theory Ser. B 124 (2017), 64–87.
J. Balogh and H. Nguyen, A general law of large permanent, Discrete Contin. Dyn. Syst. 37 (2017), no. 10, 5285--5297.
J. Balogh, P. Hu, B. Lidický, F. Pfender, J. Volec, M. Young, Rainbow triangles in three-colored graphs, J. Combin. Theory Ser. B. 126 (2017) 83--113
J. Balogh, Hong Liu, and M. Sharifzadeh, On two problems in Ramsey-Turán theory, SIAM J. Discrete Math., 31 (2017), no. 3, 1848--1866.
J. Balogh, F. Mousset, and J. Skokan An extension of Dirac's Theorem, Electronic J. Combinatorics, Volume 24, Issue 3 (2017) 25 pp. P3.56
J. Balogh, N. Bushaw, M. Collares Neto, H. Liu, R. Morris and M. Sharifzadeh, The typical structure of graphs with no large cliques, Combinatorica, 37 (2017), 4, 617--632.
2016 [103--112]
J. Balogh, R. Morris, W. Samotij, and L. Warnke, The typical structure of sparse $K_{r+1}$-free graphs, Transactions of AMS, 368 (2016) 6439--6485.
J. Balogh, A. Zs. Wagner, Further applications of the Container Method, book chapter: Recent Trends in Combinatorics, Editors: A. Beveridge, J. R. Griggs, L. Hogben, G. Musiker, P. Tetali; Springer 2016.
J. Balogh, A. Treglown and A. Zs. Wagner, Applications of graph containers in the Boolean lattice, Random Structures and Algorithms, 49 (2016), no. 4, 845--872.
J. Balogh, J. Butterfield, Ping Hu, and J. Lenz, Mantel's Theorem for Random Hypergraphs, Random Structures and Algorithms, 48 (2016), no. 4, 641--654.
J. Balogh, T. Molla, M. Sharifzadeh, with an Appendix by Christian Reiher and Mathias Schacht Triangle factors of graphs without large independent sets and of weighted graphs, Random Structures and Algorithms, 49 (2016), no. 4, 669--693.
J. Balogh, P. Hu, B. Lidický, F. Pfender: Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle, European Journal of Combinatorics, European Journal of Combinatorics volume 52, issue, year 2016, pp. 47 - 58
J. Balogh, J. Butterfield, P. Hu, J. Lenz and D. Mubayi , On the Chromatic Thresholds of Hypergraphs , Combinatorics, Probability and Computing, 25 (2016), no. 2, 172--212.
J. Balogh and J. Lenz, Hypergraphs with Zero Chromatic Threshold, Graphs and Combinatorics, (2016) 32(4), 1249-1262.
J. Balogh, B. Csaba, R. Martin, and A. Pluhar, On the path separation number of graphs, Discrete Applied Mathematics, Discrete Appl. Math. 213 (2016), 26--33.
J. Balogh, M. Delcourt, B. Lidický, C. Palmer, Rainbow copies of C4 in edge-colored hypercubes, Discrete Applied Mathematics, 210 (2016), 35–37.
2015 [93-- 102 ]
J. Balogh, R. Morris and W. Samotij, Independent sets in hypergraphs , J. Amer. Math. Soc. 28 (2015), no. 3, 669–709.
J. Balogh, Hong Liu, M. Sharifzadeh, and A. Treglown, The number of maximal sum-free subsets of integers, Proceedings of AMS., 143 (2015), no. 11, 4713--4721.
J. Balogh, Ping Hu, and M. Simonovits, Phase transitions in the Ramsey-Tur\'an theory, J ournal of Combinatorial Theory, Series B (2015), 148--169.
J. Balogh, Hong Liu, Maryam Sharifzadeh, Subdivisions of a large clique in $C_6$-free graphs, Journal of Combinatorial Theory, Series B. 112, (2015), 18--35.
J. Balogh, B. Bollobas, and B. P. Narayanan: Transference for the Erdos--Ko--Rado theorem, Forum of Mathematics, Sigma, 3, (2015), 18 pages.
J. Balogh, Hong Liu, S. Petrickova, and M. Sharifzadeh, The typical structure of maximal triangle-free graphs. Forum of Mathematics, Sigma, 3, (2015), 19 pages
J. Balogh, S. Das, M. Delcourt, Hong Liu, M. Sharifzadeh The typical structure of intersecting families of discrete structures, Journal of Combinatorial Theory, Series A, 132 (2015), 224--245.
J. Balogh, J. Leanos and G. Salazar, On the decay of crossing numbers of sparse graphs, J. of Graph Theory. 80 (2015), no. 3, 226--251.
J. Balogh, P. Hu, B. Lidický, O. Pikhurko, B. Udvari, J. Volec, Minimum number of monotone subsequences of length 4 in permutations, Combinatorics, Probability and Computing, (2015) volume 24, issue 04, pp. 658--679.
J. Balogh, and G. Salazar, Decompositions of permutations and book embeddings, SIAM J. Discrete Math. 29 (2015), no. 2, 811–822.
2014 [85-- 92]
N. Alon, J. Balogh, R. Morris and W. Samotij, A refinement of the Cameron-Erdos Conjecture , Proc. of the London Math. Soc. 108 (2014), no. 1, 44--72.
J. Balogh and S. Petrickova, The number of the maximal triangle-free graphs, Bull. London Math. Soc. (2014) 46 (5): 1003--1006.
J. Balogh, R. Mycroft and A. Treglown, A random version of Sperner's theorem, Journal of Combinatorial Theory, Series A, 128, (2014), 104--110.
J. Balogh, Hong Liu, On the number of K_4-saturating edges, Journal of Combinatorial Theory, Series B. 109 (2014), 250--257.
N. Alon, J. Balogh, R. Morris and W. Samotij, Counting sum-free sets in Abelian groups, Israel Journal of mathematics. 199 (2014), no. 1, 309--344.
J. Balogh, R. Morris and W. Samotij, Random sum-free subsets of Abelian groups , Israel Journal of mathematics. 199 (2014), no. 2, 651--685.
J. Balogh, P. Hu, B. Lidicky and H. Liu, Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube, European Journal of Combinatorics, 35 (2014), 75–-85. All the programs as well as their inputs and outputs.
J. Balogh, J. Barat, D. Gerbner, A. Gyarfas and G. Sarkozy, Partitioning 2-edge-colored graphs by monochromatic paths and cycles, Combinatorica 34 (2014), no. 5, 507--526.
2013 [79--84]
J. Balogh and J. Lenz, On the Ramsey-Turan numbers of graphs and hypergraphs, Israel Journal of mathematics. 194 (2013) 45--68.
J. Balogh, H. González-Aguilar, and G. Salazar, Large convex holes in random point sets, Comput. Geom. 46 (2013), no. 6, 725--733.
J. Balogh and C. Palmer On the tree packing conjecture , SIAM J. Discrete Math. 27 (2013), no. 4, 1995–2006.
J. Balogh, A. V. Kostochka and A. Treglown, Perfect packings in graphs, Electronic Journal of Combinatorics, Volume 20, Issue 1 (2013), paper 57, 15 pages.
J. Balogh, A. V. Kostochka and A. Raigorodskii, Coloring some finite sets in $R_n$, Discussiones Mathematicae Graph Theory, {33} (2013) 25--31.
J. Balogh, G. Kemkes, C. Lee, and S. J. Young, Towards a Weighted version of the Hajnal-Szemerédi Theorem, to appear Combinatorics, Probability and Computing, as a problem paper, (2013) volume 22, issue 03, pp. 346-350. longer version
2012 [71--78]
J. Balogh, B. Bollobas, Hugo Duminil-Copin, and R. Morris, The sharp threshold for bootstrap percolation in all dimensions, Transactions of the American Mathematical Society, 364 (2012), 2667--2701.
J. Balogh, C. Lee and W. Samotij, Corradi and Hajnal's theorem for sparse random graphs , longer version Combinatorics, Probability and Computing, (2012) volume 21, issue 1-2, pp. 23--55.
J. Balogh and J. Lenz, Some Exact Ramsey-Turan Numbers, Bulletin of the London Mathematical Society. Bull. Lond. Math. Soc. 44 (2012), no. 6, 1251–1258.
J. Balogh and D. Mubayi; Almost all triangle-free triple systems are tripartite, Combinatorica, 32 (2012), 143--169.
J. Balogh, B. Bollobas, R. Morris and O. Riordan, Linear algebra and bootstrap percolation. Journal of Combinatorial Theory, Series A Volume 119, Issue 7 1328--1335.
J. Balogh, B. Bollobas, T. Bohman and Y. Zhao, Turan densities of some hypergraphs related to K^k_{k+1}, SIAM J. of Discrete Math. 26 (2012) 1609--1617.
J. Balogh and A. Pluhár, The positive minimum degree on game sparse graphs. Electronic J. of Combinatorics. Vol 19 (2012) paper 22.
J. Balogh, B. Bollobas, and R. Morris, Graph bootstrap percolation, Random Structures and Algorithms. 41 (2012) 413--440.
2011 [60--70]
J. Balogh, and W. Samotij, The number of K_st-free graphs, Journal of the London Mathematical Society, (2011) 83, 368--388.
J. Balogh, B. Bollobas, M. Krivelevich, T. Muller and M. Walters, Hamilton Cycles in Random Geometric Graphs, Annals of Applied Probability (2011) 21, 1053--1072.
J. Balogh, B. Csaba and W. Samotij, Local resilience of almost spanning trees in random graphs, Random Structures and Algorithms, (2011) 38, 121--139.
J. Balogh and J. Butterfield, Excluding induced subgraphs: critical graphs, Random Structures and Algorithms, (2011) 38, 100--120
J. Balogh, B. Bollobas and M. Simonovits, The fine structure of octahedron-free graphs, Journal of Combinatorial Theory, Series B 101 (2011), 67--84.
J. Balogh and W. Samotij, The number of Kmm-free graphs. Combinatorica, (2011) 31, 131--150.
N. Alon, J. Balogh, B. Bollobas, and R. Morris, The structure of almost all graphs in a hereditary property, Journal of Combinatorial Theory, Series B, 101 (2011), 85--110.
J. Balogh and W. Samotij, On the Chvatal-Erdos triangle game. Electronic J. of Combinatorics. 18 (2011) P 72.
J. Balogh, J. Lenz and H. Wu, Complete Minors, Independent Sets, and Chordal Graphs, Discussiones Mathematicae Graph Theory 31(4) (2011) 639--674 D,
J. Balogh, and A. Kostochka, Large minors in graphs with a given stability number, Discrete Mathematics (2011) 311, 2203--2215.
J. Balogh and D. Mubayi; Almost all triple systems with independent neighborhoods are semi-partite, Journal of Combinatorial Theory, Series A 118, 2011, 1494--1518.
2010 [56--59]
J. Balogh, B. Bollobas, and R. Morris, Bootstrap percolation in high dimensions, Combinatorics, Probability and Computing, (2010) 19, 643--692.
J. Balogh, and J. Butterfield, Online Ramsey Games for Triangles in Random Graphs, Discrete Mathematics, (2010) 310 3653--3657.
J. Balogh, B. Csaba, M. Pei and W. Samotij, Large Bounded Degree Trees in Expanding Graphs, Electronic Journal of Combinatorics, 17(1), Research Paper 6, 9 pp. (electronic).
J. Balogh, and W. Samotij, Almost all $C_4$-free graphs have fewer than (1-eps)\ex(n,C_4) edges, SIAM J. Discrete Math. 24 (2010), 1011--1018.
2009 [46--55]
J. Balogh, B. Bollobas, and R. Morris, Bootstrap percolation in three dimensions, Annals of Probability 37 (2009), no. 4, 1329--1380.
J. Balogh A. Kostochka, N. Prince, and M. Stiebitz, The Erdos-Lovasz Tihany Conjecture for quasi-line graphs, Discrete Mathematics, 309 (2009), no. 12, 3985--3991.
N. Alon, J. Balogh, A. Kostochka, and W. Samotij, Sizes of induced subgraphs of Ramsey graphs, Combinatorics, Probability and Computing, no. 4, 459--476.
J. Balogh, B. Bollobas and M. Simonovits, The typical structure of graphs without given excluded subgraphs , Random Structures and Algorithms, 34, no 3, 305--318.
J. Balogh, T. Bohman and D. Mubayi, Erdos-Ko-Rado in Random Hypergraphs , Combinatorics, Probability and Computing, 18 (2009), no. 5, 629--646.
J. Balogh and N. Prince, Minimum difference representations of graphs , Graphs and Combinatorics, Volume 25, Issue 5 (2009), 647--655.
J. Balogh R. Martin, A. Pluhar The diameter game, Random Structures and Algorithms, 35, no 3, 369--389.
J. Balogh, B. Bollobas, and R. Morris, Majority bootstrap percolation on the hypercube, Combinatorics, Probability and Computing, volume 18, issue 1-2, pp. 17--51.
J. Balogh and R. Martin, On Avoider-Enforcergames, SIAM Journal on Discrete Mathematics, 23, 901--908.
J. Balogh, B. Bollobas, M. Saks, and V. T. Sos, On the diversity function of a hereditary graph property, Journal of Combinatorial Theory, Series B 99 (2009), pp. 9--19.
2008 [37--45]
J. Balogh R. Martin, Edit distance and its computation, Electronic Journal of Combinatorics, 15(1), Research Paper 20, 27 pp. (electronic).
S. Kumar, T. H. Lai and J. Balogh, On k-coverage in a mostly sleeping sensor network, Wireless Network, (2008) Volume 14: 277--294.
A. Abrego, J. Balogh, S. Fernadez-Merchant, G. Salazar and J. Leanos: An extended lower bound on the number of $(\le k)$-edges to generalized configurations of points and the pseudolinear crossing number of $K_n$,, J. Combin. Theory Ser. A 115 (2008), 1257--1264.
J. Balogh, S. Bezrukov, L. Harper and Á. Seress, On the bandwidth of 3-dimensional Hamming graphs, Theoretical Computer Science, Volume 407, Issues 1-3, 6 November 2008, Pages 488--495.
J. Balogh and Kostochka, On 2-detour subgraphs of the hypercube, Graphs and Combinatorics, vol 24, 4, (2008), 265--272.
J. Balogh, G. Araujo, R. Fabila, G. Salazar and J. Urrutia, A note on harmonic subgraphs in labelled geometric graphs, Inform. Process. Lett. 105 (2008), no. 3, 98--102.
J. Balogh, D. Mubayi; A new short proof of a theorem of Ahlswede and Khachatrian, J. Combin. Theory Ser. A 115 (2008), no. 2, 326--330.
J. Balogh, S.G. Hartke, Qi Liu, and Gexin Yu, On the First-Fit Chromatic Number of Graphs, SIAM J. Discrete Math. 22, (2008) 887--900.
J. Balogh and C. Smyth, On the variance of Shannon products of graphs, Discrete Applied Mathematics Volume 156, Issue 1, January 2008, Pages 110--118.
2007 [30--36]
J. Balogh and R. Pemantle, The Klee-Minty random edge chain moves linear speed, Random Structures and Algorithms, (2007) Volume 30, 464--483.
J. Balogh, B. Bollobas and R. Morris, Hereditary properties of combinatorial structures: posets and oriented graphs, J. Graph Theory, 56 (2007), 311--332.
J. Balogh, B. Bollobas, and R. Morris, Hereditary properties of tournaments. Electron. J. Combin. 14 (2007), no. 1, Research Paper 60, 25 pp. (electronic).
J. Balogh and B. Pittel, Bootstrap percolation on random regular graphs. Random Structures and Algorithms, (2007) Volume 30, Issue 1-2, 257--286.
J. Balogh, B. Pittel and G. Salazar, Large harmonious sets of non-crossing edges for n randomly labeled vertices in convex position, Random Structures and Algorithms, (2007) Volume 30, Issue 1-2, 105--130.
J. Balogh, J. Leanos, S. Pan, R. B. Richter, and G. Salazar, The convex hull of every optimal pseudo-linear drawing of $K_n$ is a triangle. Australasian J. Combin. 38 (2007), 155--162.
J. Balogh and M. Axenovich, Graphs having small number of sizes on induced k-subgraphs. SIAM J. Discrete Math. 21 (2007), no. 1, 264--272.
2006 [22--29]
J. Balogh, B. Sudakov and P. Keevash, On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs , J. Combin. Theory Ser. B 96 (2006), no. 6, 919--932.
J. Balogh, Y. Peres and G. Pete, Bootstrap percolation on infinite trees and non-amenable groups, Combinatorics, Probability and Computing, 15 (2006) 715--730.
J. Balogh and B. Bollobas, Bootstrap percolation on the hypercube, Probability and Related Fields, 134, (2006) 624--648.
J. Balogh, B. Bollobas and R. Morris, Hereditary properties of ordered graphs. Topics in discrete mathematics, 179--213, Algorithms Combin., 26, Springer, Berlin, 2006.
J. Balogh and G. Salazar, On $k$-sets, convex quadrilaterals, and the rectilinear crossing number of K_n, Discrete Comput. Geom. 35 (2006) 671--690.
J. Balogh, D. Mubayi and A. Pluhar, On the edge-bandwidth of graph products, Theoretical Computer Science, 359 (2006) 43--57.
J. Balogh, A remark on the number of edge colorings of graphs, European J. Combin., 27 (2006) 565--573.
J. Balogh, B. Bollobas and R. Morris, Hereditary properties of partitions, ordered graphs and ordered hypergraphs, European J. of Combinatorics, 8, (2006) 1263--1281.
2005 [17--21]
J. Balogh, Keevash and Sudakov, Disjoint representability of sets and their complements, Journal of Combinatorial Theory B, 95 (2005) 12--28
J. Balogh and B. Bollobas, Hereditary properties of words, RAIRO Theoretical Informatics and Applications, Speciel Issue (Imre Simon), Vol 39, No. 1, 49--66.
J. Balogh, B. Bollobas and D. Weinreich, A jump to the Bell number for hereditary graph properties, Journal of Combinatorial Theory B, 95 (2005) 29--48.
J. Balogh M. Kochol, A. Pluhar and X. Yu, Covering planar graphs forests J. Comb Theory, B Volume: 94, May, (2005) 147--158.
J. Balogh and B. Bollobas, Unavoidable traces of set systems, Combinatorica, 25 (2005) 633--643.
2004 [12--16]
J. Balogh, N. Alon, P. Keevash and B. Sudakov, The number of edge colorings with no monochromatic cliques, J. London Mathematical Society 70 (2004) 273--288.
J. Balogh and J. Csirik, Index assignment for two-channel quantization, IEEE transitions on Information theory, 11 Vol. 50 November (2004) 2737--2751.
J. Balogh, B. Bollobas and M. Simonovits, On the number of graphs without forbidden subgraph, J. Combinatorial Theory Ser. B., 91, 1--24.
J. Balogh, O. Regev, C. Smyth, W. Steiger and M. Szegedy, Long monotone paths in line arrangements. Discrete Comput. Geom. 32 (2004), no. 2, 167--176.
J. Balogh, P. Ochem and A. Pluhar, On the interval graph of Special Graphs, J. of Graph Theory, 46 241-- 253.
2003 [10--11]
J. Balogh, J. Csirik, Y. Ishai and E. Kushulewitz, Private Computation Using a PEZ Dispenser, Theoretical Computer Science, Vol. 306, Sept 2003, 69--84
J. Balogh and B. Bollobas, Sharp thresholds in bootstrap percolation. Physics A. 326, 305--312.
2002 [6--9]
J. Balogh and A. Pluhar, The interval number of dense graphs, Discrete Mathematics Vol 256/1--2, 423--429.
J. Balogh, B. Bollobas and D. Weinreich, Measures on monotone properties of graphs, Discrete Mathematics Vol 256/1--2, 423--429.
J. Balogh, The Turan density of triple systems is not principal, J. Comb. Theory Ser. A 100, no. 1, 176--180.
J. Balogh, N. Alon, B. Bollobas and Tamas Szabo, The Game Domination Number, Discrete Mathematics Vol 256/1-2, 23--33.
2001 [5]
J. Balogh, B. Bollobas and D. Weinreich, The penultimate rate of growth for graph properties, European J. Comb, 22, 277--289.
2000 [4]
J. Balogh, B. Bollobas and D. Weinreich, The speed of hereditary properties of graphs, J. Comb. Theory Ser. B 79 131--156.
1999 [3]
J. Balogh and A. Pluhar, A sharp edge bound on the interval number of a graph, J. Graph theory 32, 153--159.
1998 [1--2]
J. Balogh and G. Pete, Random disease on the square grid, Random Structures and Algorithms 13, 409--422.
J. Balogh, On the non-existence of cyclic MDS codes, Atti Sem. Mat. Fis. Univ. Modena 46, 27--33.
Conference Proceedings (for the complete "journal version" see above list)
J. Balogh Salazar, On $k$--sets, convex quadrilaterals, and the rectilinear crossing number of $K_n$ , Proc. 12th Intl. Symp. Graph Drawing, Lecture Notes in Computer Science, Springer. Berlin 2004
J. Balogh Regev Smyth, Steiger and Szegedy, Longer monotone paths in line arrangements, 19th Annual ACM Symp. on Comp. Geometry, June 2003, 124--128.
J. Balogh Kumar and Lai, On k-coverage in a mostly sleeping sensor network Proceedings of the 10th annual international conference on Mobile computing and networking 2004, 144--158.