Year |
Citation |
Score |
2020 |
Balogh J, Clemen FC, Skokan J, Wagner AZ. The Ramsey Number of Fano Plane Versus Tight Path Electronic Journal of Combinatorics. 27. DOI: 10.3929/Ethz-B-000409088 |
0.406 |
|
2020 |
Balogh J, Csaba B, Jing Y, Pluhár A. On the Discrepancies of Graphs Electronic Journal of Combinatorics. 27. DOI: 10.37236/8425 |
0.548 |
|
2020 |
Balogh J, Clemen FC, Skokan J, Wagner AZ. The Ramsey Number of Fano Plane Versus Tight Path The Electronic Journal of Combinatorics. 27. DOI: 10.37236/8374 |
0.405 |
|
2020 |
Balogh J, Katona GOH, Linz W, Tuza Z. The domination number of the graph defined by two levels of the n-cube, II European Journal of Combinatorics. 103201. DOI: 10.1016/J.Ejc.2020.103201 |
0.484 |
|
2020 |
Balogh J, Dudek A, Li L. An analogue of the Erdős–Gallai theorem for random graphs European Journal of Combinatorics. 103200. DOI: 10.1016/J.Ejc.2020.103200 |
0.618 |
|
2020 |
Balogh J, Clemen FC, Heath E, Lavrov M. Ordered size Ramsey number of paths Discrete Applied Mathematics. 276: 13-18. DOI: 10.1016/J.Dam.2019.02.002 |
0.51 |
|
2019 |
Balogh J, Kostochka AV, Liu X. Cubic graphs with small independence ratio Electronic Journal of Combinatorics. 26. DOI: 10.37236/7272 |
0.533 |
|
2019 |
Balogh J, Li L. The typical structure of Gallai colorings and their extremal graphs Siam Journal On Discrete Mathematics. 33: 2416-2443. DOI: 10.1137/19M1253344 |
0.579 |
|
2019 |
Balogh J, Lidický B, Salazar G. Closing in on Hill's Conjecture Siam Journal On Discrete Mathematics. 33: 1261-1276. DOI: 10.1137/17M1158859 |
0.351 |
|
2019 |
Balogh J, Narayanan B, Skokan J. The number of hypergraphs without linear cycles Journal of Combinatorial Theory, Series B. 134: 309-321. DOI: 10.1016/J.Jctb.2018.07.003 |
0.414 |
|
2019 |
Balogh J, Cherkashin DD, Kiselev S. Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs European Journal of Combinatorics. 79: 228-236. DOI: 10.1016/J.Ejc.2019.03.004 |
0.534 |
|
2019 |
Balogh J, Molla T. Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs European Journal of Combinatorics. 79: 140-151. DOI: 10.1016/J.Ejc.2019.02.008 |
0.574 |
|
2019 |
Balogh J, Kostochka A, Liu X. Packing Chromatic Number of Subdivisions of Cubic Graphs Graphs and Combinatorics. 35: 513-537. DOI: 10.1007/S00373-019-02016-3 |
0.512 |
|
2018 |
Balister P, Balogh J, Bertuzzo E, Bollobás B, Caldarelli G, Maritan A, Mastrandrea R, Morris R, Rinaldo A. River landscapes and optimal channel networks. Proceedings of the National Academy of Sciences of the United States of America. PMID 29891709 DOI: 10.1073/Pnas.1804484115 |
0.54 |
|
2018 |
Balogh J, Liu H, Sharifzadeh M, Treglown A. Sharp bound on the number of maximal sum-free subsets of integers Journal of the European Mathematical Society. 20: 1885-1911. DOI: 10.4171/Jems/802 |
0.495 |
|
2018 |
Balogh J, Solymosi J. On the number of points in general position in the plane Arxiv: Combinatorics. 5202018: 4438. DOI: 10.19086/Da.4438 |
0.467 |
|
2018 |
BALOGH J, TREGLOWN A, WAGNER AZ. Tilings in Randomly Perturbed Dense Graphs Combinatorics, Probability and Computing. 28: 159-176. DOI: 10.1017/S0963548318000366 |
0.55 |
|
2018 |
BALOGH J, McDOWELL A, MOLLA T, MYCROFT R. Triangle-Tilings in Graphs Without Large Independent Sets Combinatorics, Probability and Computing. 27: 449-474. DOI: 10.1017/S0963548318000196 |
0.613 |
|
2018 |
Balogh J, Kostochka A, Liu X. Packing chromatic number of cubic graphs Discrete Mathematics. 341: 474-483. DOI: 10.1016/J.Disc.2017.09.014 |
0.54 |
|
2018 |
Balogh J, Mészáros T, Wagner AZ. Two results about the hypercube Discrete Applied Mathematics. 247: 322-326. DOI: 10.1016/J.Dam.2018.03.086 |
0.469 |
|
2018 |
Balogh J, Liu H, Montgomery R. Rainbow spanning trees in properly coloured complete graphs Discrete Applied Mathematics. 247: 97-101. DOI: 10.1016/J.Dam.2018.03.066 |
0.595 |
|
2018 |
Balogh J, Wagner AZ. Kleitman's conjecture about families of given size minimizing the number of k-chains Advances in Mathematics. 330: 229-252. DOI: 10.1016/J.Aim.2018.03.007 |
0.391 |
|
2017 |
Balogh J, Nguyen H. A general law of large permanent Discrete and Continuous Dynamical Systems. 37: 5285-5297. DOI: 10.3934/Dcds.2017229 |
0.368 |
|
2017 |
Balogh J, Mousset F, Skokan J. Stability for Vertex Cycle Covers The Electronic Journal of Combinatorics. 24. DOI: 10.37236/5185 |
0.461 |
|
2017 |
Balogh J, Liu H, Sharifzadeh M. On two problems in ramsey-turán theory Siam Journal On Discrete Mathematics. 31: 1848-1866. DOI: 10.1137/16M1086078 |
0.615 |
|
2017 |
Balogh J, Eberhard S, Narayanan B, Treglown A, Wagner AZ. An improved lower bound for Folkman's theorem Bulletin of the London Mathematical Society. 49: 745-747. DOI: 10.1112/Blms.12058 |
0.422 |
|
2017 |
Balogh J, Hu P, Lidický B, Pfender F, Volec J, Young M. Rainbow triangles in three-colored graphs Journal of Combinatorial Theory, Series B. 126: 83-113. DOI: 10.1016/J.Jctb.2017.04.002 |
0.432 |
|
2017 |
Balogh J, Lo A, Molla T. Transitive triangle tilings in oriented graphs Journal of Combinatorial Theory, Series B. 124: 64-87. DOI: 10.1016/J.Jctb.2016.12.004 |
0.563 |
|
2017 |
Balogh J, Wagner AZ. On the number of union-free families Israel Journal of Mathematics. 219: 431-448. DOI: 10.1007/S11856-017-1486-Y |
0.392 |
|
2016 |
Balogh J, Liu H, Sharifzadeh M. The number of subsets of integers with no $k$-term arithmetic progression International Mathematics Research Notices. 2017: 6168-6186. DOI: 10.1093/Imrn/Rnw077 |
0.321 |
|
2016 |
Balogh J, Morris R, Samotij W, Warnke L. The typical structure of sparse kr+1-free graphs Transactions of the American Mathematical Society. 368: 6439-6485. DOI: 10.1090/Tran/6552 |
0.578 |
|
2016 |
Balogh J, Butterfield J, Hu P, Lenz J, Mubayi D. On the Chromatic Thresholds of Hypergraphs Combinatorics Probability and Computing. 25: 172-212. DOI: 10.1017/S0963548315000061 |
0.539 |
|
2016 |
Balogh J, Hu P, Lidický B, Pfender F. Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle European Journal of Combinatorics. 52: 47-58. DOI: 10.1016/J.Ejc.2015.08.006 |
0.415 |
|
2016 |
Balogh J, Csaba B, Martin RR, Pluhár A. On the path separation number of graphs Discrete Applied Mathematics. 213: 26-33. DOI: 10.1016/J.Dam.2016.05.022 |
0.451 |
|
2016 |
Balogh J, Bushaw N, Collares M, Liu H, Morris R, Sharifzadeh M. The typical structure of graphs with no large cliques Combinatorica. 1-16. DOI: 10.1007/S00493-015-3290-9 |
0.779 |
|
2016 |
Balogh J, Molla T, Sharifzadeh M. Triangle factors of graphs without large independent sets and of weighted graphs Random Structures & Algorithms. 49: 669-693. DOI: 10.1002/Rsa.20670 |
0.586 |
|
2016 |
Balogh J, Treglown A, Wagner AZ. Applications of graph containers in the Boolean lattice Random Structures & Algorithms. 49: 845-872. DOI: 10.1002/Rsa.20666 |
0.533 |
|
2016 |
Balogh J, Butterfield J, Hu P, Lenz J. Mantel's theorem for random hypergraphs Random Structures and Algorithms. DOI: 10.1002/Rsa.20629 |
0.551 |
|
2015 |
Balogh J, Salazar G. Book embeddings of regular graphs Siam Journal On Discrete Mathematics. 29: 811-822. DOI: 10.1137/140961183 |
0.504 |
|
2015 |
Balogh J, Morris R, Samotij W. Independent sets in hypergraphs Journal of the American Mathematical Society. 28: 669-709. DOI: 10.1090/S0894-0347-2014-00816-X |
0.538 |
|
2015 |
Balogh J, Liu H, Sharifzadeh M, Treglown A. The number of maximal sum-free subsets of integers Proceedings of the American Mathematical Society. 143: 4713-4721. DOI: 10.1090/proc/12615 |
0.368 |
|
2015 |
Balogh J, Hu P, Lidický B, Pikhurko O, Udvari B, Volec J. Minimum Number of Monotone Subsequences of Length 4 in Permutations Combinatorics Probability and Computing. 24: 658-679. DOI: 10.1017/S0963548314000820 |
0.545 |
|
2015 |
BALOGH J, BOLLOBÁS B, NARAYANAN BP. TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM Forum of Mathematics, Sigma. 3. DOI: 10.1017/Fms.2015.21 |
0.713 |
|
2015 |
Balogh J, Hu P, Simonovits M. Phase transitions in Ramsey-Turán theory Journal of Combinatorial Theory. Series B. 114: 148-169. DOI: 10.1016/J.Jctb.2015.04.005 |
0.538 |
|
2015 |
Balogh J, Liu H, Sharifzadeh M. Subdivisions of a large clique in C6-free graphs Journal of Combinatorial Theory. Series B. 112: 18-35. DOI: 10.1016/J.Jctb.2014.11.004 |
0.5 |
|
2015 |
Balogh J, Das S, Delcourt M, Liu H, Sharifzadeh M. Intersecting families of discrete structures are typically trivial Journal of Combinatorial Theory. Series A. 132: 224-245. DOI: 10.1016/J.Jcta.2015.01.003 |
0.368 |
|
2015 |
Balogh J, Liu H, Sharifzadeh M, Treglown A. A sharp bound on the number of maximal sum-free sets Electronic Notes in Discrete Mathematics. 49: 57-64. DOI: 10.1016/J.Endm.2015.06.010 |
0.469 |
|
2015 |
Balogh J, Lenz J. Hypergraphs with Zero Chromatic Threshold Graphs and Combinatorics. 1-14. DOI: 10.1007/S00373-015-1667-6 |
0.469 |
|
2015 |
Balogh J, Leaños J, Salazar G. On the Decay of Crossing Numbers of Sparse Graphs Journal of Graph Theory. 80: 226-251. DOI: 10.1002/Jgt.21848 |
0.53 |
|
2014 |
Alon N, Balogh J, Morris R, Samotij W. A refinement of the Cameron-Erds conjecture Proceedings of the London Mathematical Society. 108: 44-72. DOI: 10.1112/Plms/Pdt033 |
0.463 |
|
2014 |
Balogh J, Petříčková Š. The number of the maximal triangle-free graphs Bulletin of the London Mathematical Society. 46: 1003-1006. DOI: 10.1112/Blms/Bdu059 |
0.617 |
|
2014 |
Balogh J, Liu H. On the number of K4-saturating edges Journal of Combinatorial Theory. Series B. 109: 250-257. DOI: 10.1016/J.Jctb.2014.06.008 |
0.551 |
|
2014 |
Balogh J, Mycroft R, Treglown A. A random version of Sperner's theorem Journal of Combinatorial Theory. Series A. 128: 104-110. DOI: 10.1016/J.Jcta.2014.08.003 |
0.435 |
|
2014 |
Balogh J, Hu P, Lidický B, Liu H. Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube European Journal of Combinatorics. 35: 75-85. DOI: 10.1016/J.Ejc.2013.06.003 |
0.513 |
|
2014 |
Balogh J, Morris R, Samotij W. Random sum-free subsets of abelian groups Israel Journal of Mathematics. 1-35. DOI: 10.1007/S11856-013-0071-2 |
0.411 |
|
2014 |
Alon N, Balogh J, Morris R, Samotij W. Counting sum-free sets in abelian groups Israel Journal of Mathematics. 1-36. DOI: 10.1007/S11856-013-0067-Y |
0.466 |
|
2014 |
Balogh J, Barát J, Gerbner D, Gyárfás A, Sárközy GN. Partitioning 2-edge-colored graphs by monochromatic paths and cycles Combinatorica. DOI: 10.1007/S00493-014-2935-4 |
0.532 |
|
2013 |
Balogh J, Kostochka A, Raigorodskii A. Coloring some finite sets in Rn Discussiones Mathematicae - Graph Theory. 33: 25-31. DOI: 10.7151/Dmgt.1641 |
0.567 |
|
2013 |
Balogh J, Kostochkay AV, Treglown A. On perfect packings in dense graphs Electronic Journal of Combinatorics. 20. DOI: 10.37236/3173 |
0.573 |
|
2013 |
Balogh J, Palmer C. On the tree packing conjecture Siam Journal On Discrete Mathematics. 27: 1995-2006. DOI: 10.1137/120902719 |
0.415 |
|
2013 |
Balogh J, Kemkes G, Lee C, Young SJ. Towards a weighted version of the hajnal-szemerédi theorem Combinatorics Probability and Computing. 22: 346-350. DOI: 10.1017/S0963548313000059 |
0.561 |
|
2013 |
Balogh J, Delcourt M, Lidicky´ B, Palmer C. Rainbow copies of C4 in edge-colored hypercubes Discrete Applied Mathematics. DOI: 10.1016/J.Dam.2014.10.002 |
0.351 |
|
2013 |
Balogh J, Lenz J. On the Ramsey-Turán numbers of graphs and hypergraphs Israel Journal of Mathematics. 194: 45-68. DOI: 10.1007/S11856-012-0076-2 |
0.53 |
|
2012 |
Balogh J, Pluháry A. The positive minimum degree game on sparse graphs Electronic Journal of Combinatorics. 19. DOI: 10.37236/1174 |
0.597 |
|
2012 |
Balogh J, Bohman T, Bollobás B, Zhao Y. Turán densities of some hypergraphs related to Kk k+1 Siam Journal On Discrete Mathematics. 26: 1609-1617. DOI: 10.1137/120889009 |
0.547 |
|
2012 |
Balogh J, Lenz J. Some exact Ramsey-Turán numbers Bulletin of the London Mathematical Society. 44: 1251-1258. DOI: 10.1112/Blms/Bds053 |
0.562 |
|
2012 |
Balogh J, Bollobás B, Duminil-Copin H, Morris R. The sharp threshold for bootstrap percolation in all dimensions Transactions of the American Mathematical Society. 364: 2667-2701. DOI: 10.1090/S0002-9947-2011-05552-2 |
0.604 |
|
2012 |
Balogh J, Lee C, Samotij W. Corrádi and Hajnal's theorem for sparse random graphs Combinatorics Probability and Computing. 21: 23-55. DOI: 10.1017/S0963548311000642 |
0.623 |
|
2012 |
Balogh J, Bollobás B, Morris R, Riordan O. Linear algebra and bootstrap percolation Journal of Combinatorial Theory. Series A. 119: 1328-1335. DOI: 10.1016/J.Jcta.2012.03.005 |
0.591 |
|
2012 |
Balogh J, González-Aguilar H, Salazar G. Large convex holes in random point sets Computational Geometry: Theory and Applications. DOI: 10.1016/J.Comgeo.2012.11.004 |
0.469 |
|
2012 |
Balogh J, Mubayi D. Almost all triangle-free triple systems are tripartite Combinatorica. 32: 143-169. DOI: 10.1007/S00493-012-2657-4 |
0.425 |
|
2012 |
Balogh J, Bollobás B, Morris R. Graph bootstrap percolation Random Structures and Algorithms. 41: 413-440. DOI: 10.1002/Rsa.20458 |
0.677 |
|
2011 |
Balogh J, Lenz J, Wu H. Complete minors, independent sets, and chordal graphs Discussiones Mathematicae - Graph Theory. 31: 639-674. DOI: 10.7151/Dmgt.1571 |
0.374 |
|
2011 |
Balogh J, Samotij W. On the Chvátal-Erdős Triangle Game The Electronic Journal of Combinatorics. 18. DOI: 10.37236/559 |
0.519 |
|
2011 |
Balogh J, Bollobás B, Krivelevich M, Müller T, Walters M. Hamilton cycles in random geometric graphs Annals of Applied Probability. 21: 1053-1072. DOI: 10.1214/10-Aap718 |
0.678 |
|
2011 |
Balogh J, Samotij W. The number of Ks,t-free graphs Journal of the London Mathematical Society. 83: 368-388. DOI: 10.1112/Jlms/Jdq086 |
0.524 |
|
2011 |
Balogh J, Bollobás B, Simonovits M. The fine structure of octahedron-free graphs Journal of Combinatorial Theory, Series B. 101: 67-84. DOI: 10.1016/J.Jctb.2010.11.001 |
0.692 |
|
2011 |
Alon N, Balogh J, Bollobás B, Morris R. The structure of almost all graphs in a hereditary property Journal of Combinatorial Theory, Series B. 101: 85-110. DOI: 10.1016/J.Jctb.2010.10.001 |
0.725 |
|
2011 |
Balogh J, Mubayi D. Almost all triple systems with independent neighborhoods are semi-bipartite Journal of Combinatorial Theory. Series A. 118: 1494-1518. DOI: 10.1016/J.Jcta.2011.01.006 |
0.427 |
|
2011 |
Balogh J, Kostochka AV. Large minors in graphs with given independence number Discrete Mathematics. 311: 2203-2215. DOI: 10.1016/J.Disc.2011.07.003 |
0.558 |
|
2011 |
Balogh J, Samotij W. The number of Km,m-free graphs Combinatorica. 31: 131-150. DOI: 10.1007/S00493-011-2610-Y |
0.524 |
|
2011 |
Balogh J, Butterfield J. Excluding induced subgraphs: Critical graphs Random Structures and Algorithms. 38: 100-120. DOI: 10.1002/Rsa.20353 |
0.521 |
|
2011 |
Balogh J, Csaba B, Samotij W. Local resilience of almost spanning trees in random graphs Random Structures and Algorithms. 38: 121-139. DOI: 10.1002/Rsa.20345 |
0.617 |
|
2010 |
Balogh J, Csaba B, Pei M, Samotij W. Large Bounded Degree Trees in Expanding Graphs The Electronic Journal of Combinatorics. 17. DOI: 10.37236/278 |
0.558 |
|
2010 |
Balogh J, Samotij W. Almost all C4-free graphs have fewer than (1 - ε)ex(n, C4) edges Siam Journal On Discrete Mathematics. 24: 1011-1018. DOI: 10.1137/09074989X |
0.556 |
|
2010 |
BALOGH J, BOLLOBÁS B, MORRIS R. Bootstrap Percolation in High Dimensions Combinatorics, Probability and Computing. 19: 643-692. DOI: 10.1017/S0963548310000271 |
0.602 |
|
2010 |
Balogh J, Butterfield J. Online Ramsey games for triangles in random graphs Discrete Mathematics. 310: 3653-3657. DOI: 10.1016/J.Disc.2010.09.007 |
0.531 |
|
2010 |
Balogh J, Prince N. Minimum difference representations of graphs Graphs and Combinatorics. 25: 647-655. DOI: 10.1007/S00373-010-0875-3 |
0.507 |
|
2009 |
Balogh J, Bollobás B, Morris R. Bootstrap percolation in three dimensions Annals of Probability. 37: 1329-1380. DOI: 10.1214/08-Aop433 |
0.6 |
|
2009 |
Balogh J, Martin R. On Avoider-Enforcer games Siam Journal On Discrete Mathematics. 23: 901-908. DOI: 10.1137/080721716 |
0.578 |
|
2009 |
Balogh J, Bohman T, Mubayi D. ErdsKoRado in random hypergraphs Combinatorics Probability and Computing. 18: 629-646. DOI: 10.1017/S0963548309990253 |
0.451 |
|
2009 |
Alon N, Balogh J, Kostochka A, Samotij W. Sizes of induced subgraphs of Ramsey graphs Combinatorics Probability and Computing. 18: 459-476. DOI: 10.1017/S0963548309009869 |
0.584 |
|
2009 |
BALOGH J, BOLLOBÁS B, MORRIS R. Majority Bootstrap Percolation on the Hypercube Combinatorics, Probability and Computing. 18: 17-51. DOI: 10.1017/S0963548308009322 |
0.637 |
|
2009 |
Balogh J, Bollobás B, Saks M, Sós VT. The unlabelled speed of a hereditary graph property Journal of Combinatorial Theory, Series B. 99: 9-19. DOI: 10.1016/J.Jctb.2008.03.004 |
0.695 |
|
2009 |
Balogh J, Kostochka AV, Prince N, Stiebitz M. The Erdős–Lovász Tihany conjecture for quasi-line graphs Discrete Mathematics. 309: 3985-3991. DOI: 10.1016/J.Disc.2008.11.016 |
0.436 |
|
2009 |
Balogh J, Martin R, Pluhár A. The diameter game Random Structures and Algorithms. 35: 369-389. DOI: 10.1002/Rsa.V35:3 |
0.461 |
|
2009 |
Balogh J, Bollobás B, Simonovits M. The typical structure of graphs without given excluded subgraphs Random Structures and Algorithms. 34: 305-318. DOI: 10.1002/Rsa.V34:3 |
0.638 |
|
2009 |
Balogh J, Bollobás B, Simonovits M. The typical structure of graphs without given excluded subgraphs Random Structures and Algorithms. 34: 305-318. DOI: 10.1002/rsa.20242 |
0.62 |
|
2008 |
Balogh J, Martin R. Edit Distance and its Computation The Electronic Journal of Combinatorics. 15. DOI: 10.37236/744 |
0.525 |
|
2008 |
Balogh J, Hartke SG, Liu Q, Yu G. On the first-fit chromatic number of graphs Siam Journal On Discrete Mathematics. 22: 887-900. DOI: 10.1137/060672479 |
0.575 |
|
2008 |
Balogh J, Bezrukov SL, Harper LH, Seress A. On the bandwidth of 3-dimensional Hamming graphs Theoretical Computer Science. 407: 488-495. DOI: 10.1016/J.Tcs.2008.07.029 |
0.498 |
|
2008 |
Ábrego B, Balogh J, Fernández-Merchant S, Leaños J, Salazar G. An extended lower bound on the number of (⩽k)-edges to generalized configurations of points and the pseudolinear crossing number of Kn Journal of Combinatorial Theory, Series A. 115: 1257-1264. DOI: 10.1016/J.Jcta.2007.11.004 |
0.382 |
|
2008 |
Balogh J, Mubayi D. A new short proof of a theorem of Ahlswede and Khachatrian Journal of Combinatorial Theory. Series A. 115: 326-330. DOI: 10.1016/J.Jcta.2007.03.010 |
0.39 |
|
2008 |
Araujo G, Balogh J, Fabila R, Salazar G, Urrutia J. A note on harmonic subgraphs in labelled geometric graphs Information Processing Letters. 105: 98-102. DOI: 10.1016/J.Ipl.2007.08.016 |
0.514 |
|
2008 |
Balogh J, Smyth C. On the variance of Shannon products of graphs Discrete Applied Mathematics. 156: 110-118. DOI: 10.1016/J.Dam.2007.09.008 |
0.499 |
|
2008 |
Kumar S, Lai TH, Balogh J. On k-coverage in a mostly sleeping sensor network Wireless Networks. 14: 277-294. DOI: 10.1007/S11276-006-9958-8 |
0.301 |
|
2008 |
Balogh J, Kostochka A. On 2-detour subgraphs of the hypercube Graphs and Combinatorics. 24: 265-272. DOI: 10.1007/S00373-008-0790-Z |
0.51 |
|
2007 |
Balogh J, Bollobás B, Morris R. Hereditary Properties of Tournaments The Electronic Journal of Combinatorics. 14. DOI: 10.37236/978 |
0.608 |
|
2007 |
Axenovich M, Balogh J. Graphs having small number of sizes on induced k-subgraphs Siam Journal On Discrete Mathematics. 21: 264-272. DOI: 10.1137/05064357X |
0.465 |
|
2007 |
Balogh J, Pemantle R. The Klee–Minty random edge chain moves with linear speed Random Structures and Algorithms. 30: 464-483. DOI: 10.1002/Rsa.V30:4 |
0.354 |
|
2007 |
Balogh J, Pittel BG. Bootstrap percolation on the random regular graph Random Structures and Algorithms. 30: 257-286. DOI: 10.1002/Rsa.20158 |
0.548 |
|
2007 |
Balogh J, Bollobás B, Morris R. Hereditary properties of combinatorial structures: Posets and oriented graphs Journal of Graph Theory. 56: 311-332. DOI: 10.1002/Jgt.V56:4 |
0.634 |
|
2007 |
Balogh J, Bollobás B, Morris R. Hereditary properties of combinatorial structures: Posets and oriented graphs Journal of Graph Theory. 56: 311-332. DOI: 10.1002/jgt.20266 |
0.605 |
|
2006 |
Balogh J, Peres Y, Pete G. Bootstrap percolation on infinite trees and non-amenable groups Combinatorics Probability and Computing. 15: 715-730. DOI: 10.1017/S0963548306007619 |
0.459 |
|
2006 |
Balogh J, Mubayi D, Pluhár A. On the edge-bandwidth of graph products Theoretical Computer Science. 359: 43-57. DOI: 10.1016/J.Tcs.2006.01.046 |
0.534 |
|
2006 |
Balogh J, Keevash P, Sudakov B. On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs Journal of Combinatorial Theory. Series B. 96: 919-932. DOI: 10.1016/J.Jctb.2006.03.001 |
0.473 |
|
2006 |
Balogh J, Bollobás B, Morris R. Hereditary properties of partitions, ordered graphs and ordered hypergraphs European Journal of Combinatorics. 27: 1263-1281. DOI: 10.1016/J.Ejc.2006.05.004 |
0.692 |
|
2006 |
Balogh J. A remark on the number of edge colorings of graphs European Journal of Combinatorics. 27: 565-573. DOI: 10.1016/J.Ejc.2004.12.004 |
0.619 |
|
2006 |
Balogh J, Salazar G. k-Sets, convex quadrilaterals, and the rectilinear crossing number of Kn* Discrete and Computational Geometry. 35: 671-690. DOI: 10.1007/S00454-005-1227-6 |
0.525 |
|
2006 |
Balogh J, Pittel B, Salazar G. Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position Random Structures and Algorithms. 30: 105-130. DOI: 10.1002/Rsa.V30:1/2 |
0.489 |
|
2005 |
Balogh J, Bollobás B. Hereditary properties of words Rairo - Theoretical Informatics and Applications. 39: 49-65. DOI: 10.1051/Ita:2005003 |
0.586 |
|
2005 |
Balogh J, Keevash P, Sudakov B. Disjoint representability of sets and their complements Journal of Combinatorial Theory. Series B. 95: 12-28. DOI: 10.1016/J.Jctb.2005.02.005 |
0.366 |
|
2005 |
Balogh J, Bollobás B, Weinreich D. A jump to the bell number for hereditary graph properties Journal of Combinatorial Theory. Series B. 95: 29-48. DOI: 10.1016/J.Jctb.2005.02.004 |
0.824 |
|
2005 |
Balogh J, Kochol M, Pluhár A, Yu X. Covering planar graphs with forests Journal of Combinatorial Theory, Series B. 94: 147-158. DOI: 10.1016/J.Jctb.2004.12.002 |
0.524 |
|
2005 |
Balogh J, Bollobás B. Unavoidable traces of set systems Combinatorica. 25: 633-643. DOI: 10.1007/S00493-005-0039-X |
0.54 |
|
2005 |
Balogh J, Bollobás B. Bootstrap percolation on the hypercube Probability Theory and Related Fields. 134: 624-648. DOI: 10.1007/S00440-005-0451-6 |
0.524 |
|
2004 |
Alon N, Balogh J, Keevash P, Sudakov B. The number of edge colorings with no monochromatic cliques Journal of the London Mathematical Society. 70: 273-288. DOI: 10.1112/S0024610704005563 |
0.555 |
|
2004 |
Balogh J, Csirik JA. Index assignment for two-channel quantization Ieee Transactions On Information Theory. 50: 2737-2751. DOI: 10.1109/TIT.2004.836676 |
0.322 |
|
2004 |
Balogh J, Bollobás B, Simonovits M. The number of graphs without forbidden subgraphs Journal of Combinatorial Theory, Series B. 91: 1-24. DOI: 10.1016/J.Jctb.2003.08.001 |
0.647 |
|
2004 |
Balogh J, Regev O, Smyth C, Steiger W, Szegedy M. Long Monotone Paths in Line Arrangements Discrete & Computational Geometry. 32. DOI: 10.1007/S00454-004-1119-1 |
0.37 |
|
2004 |
Balogh J, Ochem P, Pluhár A. On the interval number of special graphs Journal of Graph Theory. 46: 241-253. DOI: 10.1002/Jgt.20005 |
0.551 |
|
2003 |
Balogh J, Bollobás B. Sharp thresholds in Bootstrap percolation Physica a: Statistical Mechanics and Its Applications. 326: 305-312. DOI: 10.1016/S0378-4371(03)00364-9 |
0.502 |
|
2002 |
Balogh J, Bollobás B, Weinreich D. Measures on monotone properties of graphs Discrete Applied Mathematics. 116: 17-36. DOI: 10.1016/S0166-218X(01)00175-5 |
0.831 |
|
2002 |
Balogh J, Pluhár A. The interval number of dense graphs Discrete Mathematics. 256: 423-429. DOI: 10.1016/S0012-365X(01)00215-1 |
0.458 |
|
2002 |
Alon N, Balogh J, Bollobás B, Szabó T. Game domination number Discrete Mathematics. 256: 23-33. DOI: 10.1016/S0012-365X(00)00358-7 |
0.654 |
|
2002 |
Balogh J. The turán density of triple systems is not principal Journal of Combinatorial Theory. Series A. 100: 176-180. DOI: 10.1006/Jcta.2002.3285 |
0.431 |
|
2001 |
Balogh J, Bollobás B, Weinreich D. The Penultimate Rate of Growth for Graph Properties European Journal of Combinatorics. 22: 277-289. DOI: 10.1006/Eujc.2000.0476 |
0.824 |
|
2000 |
Balogh J, Bollobás B, Weinreich D. The Speed of Hereditary Properties of Graphs Journal of Combinatorial Theory. Series B. 79: 131-156. DOI: 10.1006/Jctb.2000.1952 |
0.818 |
|
1999 |
Balogh J, Pluhár A. A sharp edge bound on the interval number of a graph Journal of Graph Theory. 32: 153-159. DOI: 10.1002/(Sici)1097-0118(199910)32:2<>1.0.Co;2-J |
0.562 |
|
Show low-probability matches. |