József Balogh

József Balogh, Hernán González-Aguilar, Gelasio Salazar: Large convex holes in random point sets. Comput. Geom. 46(6): 725-733 (2013)

József Balogh, Graeme Kemkes, Choongbum Lee, Stephen J. Young: Towards a Weighted Version of the Hajnal-Szemerédi Theorem. Combinatorics, Probability & Computing 22(3): 346-350 (2013)

József Balogh, Alexandr V. Kostochka, Andrei Raigorodskii: Coloring some finite sets in Rⁿ . Discussiones Mathematicae Graph Theory 33(1): 25-31 (2013)

József Balogh, Dhruv Mubayi: Almost all triangle-free triple systems are tripartite. Combinatorica 32(2): 143-169 (2012)

József Balogh, Choongbum Lee, Wojciech Samotij: Corrádi and Hajnal's Theorem for Sparse Random Graphs. Combinatorics, Probability & Computing 21(1-2): 23-55 (2012)

József Balogh, Béla Bollobás, Robert Morris: Graph bootstrap percolation. Random Struct. Algorithms 41(4): 413-440 (2012)

József Balogh, Tom Bohman, Béla Bollobás, Yi Zhao: Turán Densities of Some Hypergraphs Related to K_k+1^k. SIAM J. Discrete Math. 26(4): 1609-1617 (2012)

József Balogh, Hernán González-Aguilar, Gelasio Salazar: Large convex holes in random point sets. CoRR abs/1206.0805 (2012)

József Balogh, Wojciech Samotij: The number of K_{m, m}-free graphs. Combinatorica 31(2): 131-150 (2011)

József Balogh, Wojciech Samotij: On the Chvátal-Erdös Triangle Game. Electr. J. Comb. 18(1) (2011)

József Balogh, Alexandr V. Kostochka: Large minors in graphs with given independence number. Discrete Mathematics 311(20): 2203-2215 (2011)

József Balogh, John Lenz, Hehui Wu: Complete minors, independent sets, and chordal graphs. Discussiones Mathematicae Graph Theory 31(4): 639-674 (2011)

József Balogh, Béla Bollobás, Miklós Simonovits: The fine structure of octahedron-free graphs. J. Comb. Theory, Ser. B 101(2): 67-84 (2011)

Noga Alon, József Balogh, Béla Bollobás, Robert Morris: The structure of almost all graphs in a hereditary property. J. Comb. Theory, Ser. B 101(2): 85-110 (2011)

József Balogh, Dhruv Mubayi: Almost all triple systems with independent neighborhoods are semi-bipartite. J. Comb. Theory, Ser. A 118(4): 1494-1518 (2011)

József Balogh, Jane Butterfield: Excluding induced subgraphs: Critical graphs. Random Struct. Algorithms 38(1-2): 100-120 (2011)

József Balogh, Béla Csaba, Wojciech Samotij: Local resilience of almost spanning trees in random graphs. Random Struct. Algorithms 38(1-2): 121-139 (2011)

József Balogh, Béla Csaba, Martin Pei, Wojciech Samotij: Large Bounded Degree Trees in Expanding Graphs. Electr. J. Comb. 17(1) (2010)

József Balogh, Béla Bollobás, Robert Morris: Bootstrap Percolation in High Dimensions. Combinatorics, Probability & Computing 19(5-6): 643-692 (2010)

József Balogh, Jane Butterfield: Online Ramsey games for triangles in random graphs. Discrete Mathematics 310(24): 3653-3657 (2010)

József Balogh, Wojciech Samotij: Almost All C₄-Free Graphs Have Fewer than (1-epsilon), ex(n, C₄) Edges. SIAM J. Discrete Math. 24(3): 1011-1018 (2010)

József Balogh, Béla Bollobás, Robert Morris: Majority Bootstrap Percolation on the Hypercube. Combinatorics, Probability & Computing 18(1-2): 17-51 (2009)

Noga Alon, József Balogh, Alexandr V. Kostochka, Wojciech Samotij: Sizes of Induced Subgraphs of Ramsey Graphs. Combinatorics, Probability & Computing 18(4): 459-476 (2009)

József Balogh, Tom Bohman, Dhruv Mubayi: Erdos-Ko-Rado in Random Hypergraphs. Combinatorics, Probability & Computing 18(5): 629-646 (2009)

József Balogh, Alexandr V. Kostochka, Noah Prince, Michael Stiebitz: The Erdos-Lovász Tihany conjecture for quasi-line graphs. Discrete Mathematics 309(12): 3985-3991 (2009)

József Balogh, Noah Prince: Minimum Difference Representations of Graphs. Graphs and Combinatorics 25(5): 647-655 (2009)

József Balogh, Béla Bollobás, Michael E. Saks, Vera T. Sós: The unlabelled speed of a hereditary graph property. J. Comb. Theory, Ser. B 99(1): 9-19 (2009)

József Balogh, Béla Bollobás, Miklós Simonovits: The typical structure of graphs without given excluded subgraphs. Random Struct. Algorithms 34(3): 305-318 (2009)

József Balogh, Ryan Martin, András Pluhár: The diameter game. Random Struct. Algorithms 35(3): 369-389 (2009)

József Balogh, Ryan Martin: On Avoider-Enforcer Games. SIAM J. Discrete Math. 23(2): 901-908 (2009)

József Balogh, Ryan Martin: Edit Distance and its Computation. Electr. J. Comb. 15(1) (2008)

József Balogh, Clifford D. Smyth: On the variance of Shannon products of graphs. Discrete Applied Mathematics 156(1): 110-118 (2008)

József Balogh, Alexandr V. Kostochka: On 2-Detour Subgraphs of the Hypercube. Graphs and Combinatorics 24(4): 265-272 (2008)

Gabriela Araujo, József Balogh, Ruy Fabila Monroy, Gelasio Salazar, Jorge Urrutia: A note on harmonic subgraphs in labelled geometric graphs. Inf. Process. Lett. 105(3): 98-102 (2008)

József Balogh, Dhruv Mubayi: A new short proof of a theorem of Ahlswede and Khachatrian. J. Comb. Theory, Ser. A 115(2): 326-330 (2008)

Bernardo M. Ábrego, József Balogh, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar: An extended lower bound on the number of (k)-edges to generalized configurations of points and the pseudolinear crossing number of K_n. J. Comb. Theory, Ser. A 115(7): 1257-1264 (2008)

József Balogh, Stephen G. Hartke, Qi Liu, Gexin Yu: On the First-Fit Chromatic Number of Graphs. SIAM J. Discrete Math. 22(3): 887-900 (2008)

Santosh Kumar, Ten-Hwang Lai, József Balogh: On k-coverage in a mostly sleeping sensor network. Wireless Networks 14(3): 277-294 (2008)

József Balogh, Béla Bollobás, Robert Morris: Hereditary Properties of Tournaments. Electr. J. Comb. 14(1) (2007)

József Balogh, Béla Bollobás, Robert Morris: Hereditary properties of combinatorial structures: Posets and oriented graphs. Journal of Graph Theory 56(4): 311-332 (2007)

József Balogh, Boris Pittel, Gelasio Salazar: Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position. Random Struct. Algorithms 30(1-2): 105-130 (2007)

József Balogh, Boris Pittel: Bootstrap percolation on the random regular graph. Random Struct. Algorithms 30(1-2): 257-286 (2007)

József Balogh, Robin Pemantle: The Klee-Minty random edge chain moves with linear speed. Random Struct. Algorithms 30(4): 464-483 (2007)

Maria Axenovich, József Balogh: Graphs Having Small Number of Sizes on Induced k-Subgraphs. SIAM J. Discrete Math. 21(1): 264-272 (2007)

József Balogh, Yuval Peres, Gábor Pete: Bootstrap Percolation on Infinite Trees and Non-Amenable Groups. Combinatorics, Probability & Computing 15(5): 715-730 (2006)

József Balogh, Gelasio Salazar: k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of K_n. Discrete & Computational Geometry 35(4): 671-690 (2006)

József Balogh: A remark on the number of edge colorings of graphs. Eur. J. Comb. 27(4): 565-573 (2006)

József Balogh, Béla Bollobás, Robert Morris: Hereditary properties of partitions, ordered graphs and ordered hypergraphs. Eur. J. Comb. 27(8): 1263-1281 (2006)

József Balogh, Peter Keevash, Benny Sudakov: On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs. J. Comb. Theory, Ser. B 96(6): 919-932 (2006)

József Balogh, Dhruv Mubayi, András Pluhár: On the edge-bandwidth of graph products. Theor. Comput. Sci. 359(1-3): 43-57 (2006)

József Balogh, Béla Bollobás: Unavoidable Traces Of Set Systems. Combinatorica 25(6): 633-643 (2005)

József Balogh, Béla Bollobás: Hereditary properties of words. ITA 39(1): 49-65 (2005)

József Balogh, Martin Kochol, András Pluhár, Xingxing Yu: Covering planar graphs with forests. J. Comb. Theory, Ser. B 94(1): 147-158 (2005)

József Balogh, Peter Keevash, Benny Sudakov: Disjoint representability of sets and their complements. J. Comb. Theory, Ser. B 95(1): 12-28 (2005)

József Balogh, Béla Bollobás, David Weinreich: A jump to the bell number for hereditary graph properties. J. Comb. Theory, Ser. B 95(1): 29-48 (2005)

József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy: Long Monotone Paths in Line Arrangements. Discrete & Computational Geometry 32(2): 167-176 (2004)

József Balogh, Béla Bollobás, Miklós Simonovits: The number of graphs without forbidden subgraphs. J. Comb. Theory, Ser. B 91(1): 1-24 (2004)

József Balogh, Pascal Ochem, András Pluhár: On the interval number of special graphs. Journal of Graph Theory 46(4): 241-253 (2004)

József Balogh, János A. Csirik: Index assignment for two-channel quantization. IEEE Transactions on Information Theory 50(11): 2737-2751 (2004)

József Balogh, Gelasio Salazar: Improved Bounds for the Number of (<=k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of K_n. Graph Drawing 2004: 25-35

Santosh Kumar, Ten-Hwang Lai, József Balogh: On k-coverage in a mostly sleeping sensor network. MOBICOM 2004: 144-158

József Balogh, János A. Csirik, Yuval Ishai, Eyal Kushilevitz: Private computation using a PEZ dispenser. Theor. Comput. Sci. 306(1-3): 69-84 (2003)

József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy: Long monotone paths in line arrangements. Symposium on Computational Geometry 2003: 124-128

József Balogh, Béla Bollobás, David Weinreich: Measures on monotone properties of graphs. Discrete Applied Mathematics 116(1-2): 17-36 (2002)

Noga Alon, József Balogh, Béla Bollobás, Tamás Szabó: Game domination number. Discrete Mathematics 256(1-2): 23-33 (2002)

József Balogh, András Pluhár: The interval number of dense graphs. Discrete Mathematics 256(1-2): 423-429 (2002)

József Balogh: The Turan Density of Triple Systems Is Not Principal. J. Comb. Theory, Ser. A 100(1): 176-180 (2002)

József Balogh, Béla Bollobás, David Weinreich: The Penultimate Rate of Growth for Graph Properties. Eur. J. Comb. 22(3): 277-289 (2001)

József Balogh, Béla Bollobás, David Weinreich: The Speed of Hereditary Properties of Graphs. J. Comb. Theory, Ser. B 79(2): 131-156 (2000)

József Balogh, András Pluhár: A sharp edge bound on the interval number of a graph. Journal of Graph Theory 32(2): 153-159 (1999)

József Balogh, Gábor Pete: Random disease on the square grid. Random Struct. Algorithms 13(3-4): 409-422 (1998)