Preprints

•   J. Balogh,   Jane Butterfield, Ping Hu, John Lenz and Dhruv Mubayi ,     On the Chromatic Thresholds of Hypergraphs , submitted,
•   J. Balogh,   Ping Hu, Bernard Lidicky and Hong Liu,     Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube , submitted, All the programs as well as their inputs and outputs.
•   N. Alon, J. Balogh,   R. Morris and W. Samotij,     Counting sum-free sets in Abelian groups , submitted,
•   J. Balogh,   R. Morris and W. Samotij,     Random sum-free subsets of Abelian groups , submitted,
•   J. Balogh, A. V. Kostochka and A. Treglown, Perfect packings in graphs, submitted
•   J. Balogh, J. Barat, D. Gergner, A. Gyarfas and G. Sarkozy, Partitioning edge-2-colored graphs by monochromatic paths and cycles, submitted
•   J. Balogh, B. Bollobas, T. Bohman and Y. Zhao, Turan densities of some hypergraphs related to K^k_{k+1}, submitted
•   J. Balogh, A. V. Kostochka and A. Raigorodskii, Coloring some finite sets in $R_n$, submitted
•   J. Balogh, B. Bollobas, and R. Morris, Graph bootstrap percolation, submitted
•   J. Balogh and J. Lenz, Some Exact Ramsey-Turan Numbers,

To appear

•   J. Balogh and J. Lenz, On the Ramsey-Turan numbers of graphs and hypergraphs, Israel Journal of mathematics,
•   J. Balogh,   C. Lee and W. Samotij,     Corradi and Hajnal's theorem for sparse random graphs , longer version Combinatorics, Probability and Computing,
•   J. Balogh, B. Bollobas, R. Morris and O. Riordan, Linear algebra in bootstrap percolation, JCT A
•   J. Balogh and D. Mubayi; Almost all triangle-free triple systems are tripartite, Combinatorica

2012 [71-- ]

•   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 and A. Pluhár, The positive minimum degree on game sparse graphs. Electronic J. of Combinatorics. Vol 19 (2012) paper 22.

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, 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 Volume 118, Issue 4, May 2011, Pages 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,  Bollobas and 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
• Abrego, Balogh, Fernadez-Merchant G. Salazar and 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,  Bezrukov, 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, 887--900 (2008)
•   J. Balogh and   C. Smyth, On the variance of Shannon products of graphs, Discrete Applied Mathematics Volume 156, Issue 1, 1 January 2008, Pages 110-118

2007 [30--36]

•   J. Balogh  and  Pemantle, The Klee-Minty random edge chain moves linear speed, Random Structures and Algorithms, (2007) Volume 30, 464--483
  
•   J. Balogh,  Bollobas and Morris, Hereditary properties of combinatorial structures: posets and oriented graphs , J. Graph Theory, 56 (2007), 311--332.
• Balogh, Bollobas, Morris, Hereditary properties of tournaments. Electron. J. Combin. 14 (2007), no. 1, Research Paper 60, 25 pp. (electronic).
•   J. Balogh and   Pittel, Bootstrap percolation on random regular graphs Random Structures and Algorithms, (2007) Volume 30, Issue 1-2, 257--286
• J. Balogh,  Pittel  and 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   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,  Sudakov and 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,  Peres and 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,  Bollobas and Morris,   Hereditary properties of ordered graphs. Topics in discrete mathematics, 179--213, Algorithms Combin., 26, Springer, Berlin, 2006.
•   J. Balogh and  Salazar, On $k$-sets, convex quadrilaterals, and the rectilinear crossing number of K_n, Discrete Comput. Geom. 35 (2006) 671--690
  
•   J. Balogh,  Mubayi and 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,  Bollobas and 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  Bollobas, Hereditary properties of words, RAIRO Theoretical Informatics and Applications, Speciel Issue (Imre Simon), Vol 39, No. 1, 49-66.
•  J. Balogh  Bollobas and Weinreich, A jump to the Bell number for hereditary graph properties,, Journal of Combinatorial Theory B,   95 (2005) 29--48
  
• J. Balogh  Kochol, Pluhar and X. Yu, Covering planar graphs forests J. Comb Theory,  B Volume: 94,  May, (2005) 147-158.
• J. Balogh and  Bollobas, Unavoidable traces of set systems,  Combinatorica,  25 (2005) 633--643.
  
  

2004 [12--16]

•   J. Balogh,   Alon,  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,  Bollobas and Simonovits, On the number of graphs without forbidden subgraph, J. Combinatorial Theory Ser. B., 91, 1--24
• J. Balogh, Regev, Smyth, Steiger and Szegedy, Long monotone paths in line arrangements.Discrete Comput. Geom. 32 (2004), no. 2, 167--176.
•   J. Balogh,  Ochem and 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  Bollobas, Sharp thresholds in bootstrap percolation. Physics A. 326, 305--312.

2002 [6--9]

• J. Balogh  and Pluhar, The interval number of dense graphs, , Discrete Mathematics Vol 256/1--2,  423--429.
• J. Balogh,  Bollobas and 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,  Alon, Bollobas and Szabo, The Game Domination Number, Discrete Mathematics Vol 256/1-2, 23--33.

2001 [5]

• J. Balogh,  Bollobas and Weinreich, The penultimate rate of growth for graph properties, Europian J. Comb, 22, 277-289.

2000 [4]

• J. Balogh,  Bollobas and Weinreich, The speed of hereditary properties of graphs, J. Comb. Theory Ser. B 79 131-156.

1999 [3]

• J. Balogh and  Pluhar, The interval number of dense graphs,  Discrete Math. 256. no 1-2, 423-429.

1998 [1--2]

• J. Balogh  and 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.