Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDJózsef Balogh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j133]József Balogh, Felix Christian Clemen
, Bernard Lidický:
Maximum number of almost similar triangles in the plane. Comput. Geom. 105-106: 101880 (2022)- [j132]József Balogh, Alexandr V. Kostochka, Mikhail Lavrov, Xujun Liu:
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree. Comb. Probab. Comput. 31(1): 109-122 (2022) - [j131]József Balogh, Michelle Delcourt, Emily Heath, Lina Li:
Generalized rainbow Turán numbers of odd cycles. Discret. Math. 345(2): 112663 (2022) - [j130]József Balogh, Maksim Zhukovskii:
On the sizes of large subgraphs of the binomial random graph. Discret. Math. 345(2): 112675 (2022) - [j129]József Balogh, Felix Christian Clemen, Emily Heath, Mikhail Lavrov:
A strengthening of the Erdős-Szekeres Theorem. Eur. J. Comb. 101: 103456 (2022) - [j128]József Balogh, Lina Li, Andrew Treglown:
Tilings in vertex ordered graphs. J. Comb. Theory, Ser. B 155: 171-201 (2022) - [j127]József Balogh, Alexandr V. Kostochka, Mikhail Lavrov, Xujun Liu:
Monochromatic connected matchings in 2-edge-colored multipartite graphs. J. Graph Theory 100(3): 578-607 (2022) - [i3]József Balogh, Dingding Dong, Bernard Lidický, Nitya Mani, Yufei Zhao:
Nearly all k-SAT functions are unate. CoRR abs/2209.04894 (2022) - 2021
- [j126]Igor Araújo, József Balogh, Ramon Garcia:
On the Number of Sum-Free Triplets of Sets. Electron. J. Comb. 28(4) (2021) - [j125]József Balogh, Béla Csaba, András Pluhár, Andrew Treglown:
A discrepancy version of the Hajnal-Szemerédi theorem. Comb. Probab. Comput. 30(3): 444-459 (2021) - [j124]József Balogh, Felix Christian Clemen, Mikhail Lavrov, Bernard Lidický, Florian Pfender:
Making Kr+1-free graphs r-partite. Comb. Probab. Comput. 30(4): 609-618 (2021) - [j123]József Balogh, Andrzej Dudek, Lina Li:
An analogue of the Erdős-Gallai theorem for random graphs. Eur. J. Comb. 91: 103200 (2021) - [j122]József Balogh, Gyula O. H. Katona, William Linz, Zsolt Tuza:
The domination number of the graph defined by two levels of the n-cube, II. Eur. J. Comb. 91: 103201 (2021) - [j121]József Balogh, Ramon Garcia, Lina Li:
Independent sets in the middle two layers of Boolean lattice. J. Comb. Theory, Ser. A 178: 105341 (2021) - [j120]József Balogh, Béla Bollobás, Bhargav P. Narayanan:
Counting independent sets in regular hypergraphs. J. Comb. Theory, Ser. A 180: 105405 (2021) - [j119]József Balogh, Nathan Lemons, Cory Palmer:
Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree. SIAM J. Discret. Math. 35(3): 1525-1535 (2021) - [i2]József Balogh, Zoltán Füredi, Souktik Roy:
An upper bound on the size of Sidon sets. CoRR abs/2103.15850 (2021) - 2020
- [j118]József Balogh, Felix Christian Clemen, Jozef Skokan, Adam Zsolt Wagner:
The Ramsey Number of Fano Plane Versus Tight Path. Electron. J. Comb. 27(1): 1 (2020) - [j117]József Balogh, Béla Csaba, Yifan Jing, András Pluhár:
On the Discrepancies of Graphs. Electron. J. Comb. 27(2): 2 (2020) - [j116]József Balogh, Felix Christian Clemen, Emily Heath, Mikhail Lavrov:
Ordered size Ramsey number of paths. Discret. Appl. Math. 276: 13-18 (2020) - [j115]József Balogh, Lina Li:
On the number of linear hypergraphs of large girth. J. Graph Theory 93(1): 113-141 (2020) - [j114]József Balogh, Sárka Petrícková, Adam Zsolt Wagner:
Families in posets minimizing the number of comparable pairs. J. Graph Theory 95(4): 655-676 (2020)
2010 – 2019
- 2019
- [j113]József Balogh, Alexandr V. Kostochka, Xujun Liu:
Cubic Graphs with Small Independence Ratio. Electron. J. Comb. 26(1): 1 (2019) - [j112]József Balogh, Shagnik Das, Hong Liu, Maryam Sharifzadeh, Tuan Tran:
Structure and Supersaturation for Intersecting Families. Electron. J. Comb. 26(2): 2 (2019) - [j111]József Balogh, Mikhail Lavrov, George Shakan, Adam Zsolt Wagner:
Monochromatic Hilbert Cubes and Arithmetic Progressions. Electron. J. Comb. 26(2): 2 (2019) - [j110]József Balogh, Andrew Treglown, Zsolt Adam Wagner:
Tilings in Randomly Perturbed Dense Graphs. Comb. Probab. Comput. 28(2): 159-176 (2019) - [j109]József Balogh, Theodore Molla:
Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs. Eur. J. Comb. 79: 140-151 (2019) - [j108]József Balogh, Danila D. Cherkashin, Sergei Kiselev:
Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs. Eur. J. Comb. 79: 228-236 (2019) - [j107]József Balogh, Alexandr V. Kostochka, Xujun Liu:
Packing Chromatic Number of Subdivisions of Cubic Graphs. Graphs Comb. 35(2): 513-537 (2019) - [j106]József Balogh, Bhargav P. Narayanan, Jozef Skokan:
The number of hypergraphs without linear cycles. J. Comb. Theory, Ser. B 134: 309-321 (2019) - [j105]József Balogh, Bernard Lidický, Gelasio Salazar:
Closing in on Hill's Conjecture. SIAM J. Discret. Math. 33(3): 1261-1276 (2019) - [j104]József Balogh, Lina Li:
The Typical Structure of Gallai Colorings and Their Extremal Graphs. SIAM J. Discret. Math. 33(4): 2416-2443 (2019) - 2018
- [j103]József Balogh, Andrew McDowell, Theodore Molla, Richard Mycroft:
Triangle-Tilings in Graphs Without Large Independent Sets. Comb. Probab. Comput. 27(4): 449-474 (2018) - [j102]József Balogh, Hong Liu, Richard Montgomery:
Rainbow spanning trees in properly coloured complete graphs. Discret. Appl. Math. 247: 97-101 (2018) - [j101]József Balogh, Tamás Mészáros, Zsolt Adam Wagner:
Two results about the hypercube. Discret. Appl. Math. 247: 322-326 (2018) - [j100]József Balogh, Alexandr V. Kostochka, Xujun Liu:
Packing chromatic number of cubic graphs. Discret. Math. 341(2): 474-483 (2018) - 2017
- [j99]József Balogh, Neal Bushaw, Maurício Collares Neto, Hong Liu, Robert Morris, Maryam Sharifzadeh:
The typical structure of graphs with no large cliques. Comb. 37(4): 617-632 (2017) - [j98]József Balogh, Frank Mousset, Jozef Skokan:
Stability for Vertex Cycle Covers. Electron. J. Comb. 24(3): 3 (2017) - [j97]József Balogh, Allan Lo, Theodore Molla:
Transitive triangle tilings in oriented graphs. J. Comb. Theory, Ser. B 124: 64-87 (2017) - [j96]József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, Jan Volec, Michael Young:
Rainbow triangles in three-colored graphs. J. Comb. Theory, Ser. B 126: 83-113 (2017) - [j95]József Balogh, Hong Liu, Maryam Sharifzadeh:
On Two Problems in Ramsey-Turán Theory. SIAM J. Discret. Math. 31(3): 1848-1866 (2017) - 2016
- [j94]József Balogh, Jane Butterfield, Ping Hu, John Lenz, Dhruv Mubayi:
On the Chromatic Thresholds of Hypergraphs. Comb. Probab. Comput. 25(2): 172-212 (2016) - [j93]József Balogh, Michelle Delcourt, Bernard Lidický, Cory Palmer:
Rainbow copies of C4 in edge-colored hypercubes. Discret. Appl. Math. 210: 35-37 (2016) - [j92]József Balogh, Béla Csaba, Ryan R. Martin, András Pluhár:
On the path separation number of graphs. Discret. Appl. Math. 213: 26-33 (2016) - [j91]József Balogh, Ping Hu, Bernard Lidický, Florian Pfender:
Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle. Eur. J. Comb. 52: 47-58 (2016) - [j90]József Balogh, John Lenz:
Hypergraphs with Zero Chromatic Threshold. Graphs Comb. 32(4): 1249-1262 (2016) - [j89]József Balogh, Jane Butterfield, Ping Hu, John Lenz:
Mantel's theorem for random hypergraphs. Random Struct. Algorithms 48(4): 641-654 (2016) - [j88]József Balogh, Theodore Molla, Maryam Sharifzadeh:
Triangle factors of graphs without large independent sets and of weighted graphs. Random Struct. Algorithms 49(4): 669-693 (2016) - [j87]József Balogh, Andrew Treglown, Zsolt Adam Wagner:
Applications of graph containers in the Boolean lattice. Random Struct. Algorithms 49(4): 845-872 (2016) - 2015
- [j86]József Balogh, Ping Hu, Bernard Lidický, Oleg Pikhurko, Balázs Udvari, Jan Volec:
Minimum Number of Monotone Subsequences of Length 4 in Permutations. Comb. Probab. Comput. 24(4): 658-679 (2015) - [j85]József Balogh, Hong Liu, Maryam Sharifzadeh, Andrew Treglown:
A sharp bound on the number of maximal sum-free sets. Electron. Notes Discret. Math. 49: 57-64 (2015) - [j84]József Balogh, Hong Liu, Maryam Sharifzadeh:
Subdivisions of a large clique in C6-free graphs. J. Comb. Theory, Ser. B 112: 18-35 (2015) - [j83]József Balogh, Ping Hu, Miklós Simonovits:
Phase transitions in Ramsey-Turán theory. J. Comb. Theory, Ser. B 114: 148-169 (2015) - [j82]József Balogh, Shagnik Das, Michelle Delcourt, Hong Liu, Maryam Sharifzadeh:
Intersecting families of discrete structures are typically trivial. J. Comb. Theory, Ser. A 132: 224-245 (2015) - [j81]József Balogh, Jesús Leaños, Gelasio Salazar:
On the Decay of Crossing Numbers of Sparse Graphs. J. Graph Theory 80(3): 226-251 (2015) - [j80]József Balogh, Gelasio Salazar:
Book Embeddings of Regular Graphs. SIAM J. Discret. Math. 29(2): 811-822 (2015) - 2014
- [j79]József Balogh, János Barát, Dániel Gerbner, András Gyárfás, Gábor N. Sárközy:
Partitioning 2-edge-colored graphs by monochromatic paths and cycles. Comb. 34(5): 507-526 (2014) - [j78]József Balogh, Ping Hu, Bernard Lidický, Hong Liu:
Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube. Eur. J. Comb. 35: 75-85 (2014) - [j77]József Balogh, Hong Liu:
On the number of K4-saturating edges. J. Comb. Theory, Ser. B 109: 250-257 (2014) - [j76]József Balogh, Richard Mycroft, Andrew Treglown:
A random version of Sperner's theorem. J. Comb. Theory, Ser. A 128: 104-110 (2014) - 2013
- [j75]József Balogh, Alexandr V. Kostochka, Andrew Treglown:
On Perfect Packings in Dense Graphs. Electron. J. Comb. 20(1): 57 (2013) - [j74]József Balogh, Hernán González-Aguilar, Gelasio Salazar:
Large convex holes in random point sets. Comput. Geom. 46(6): 725-733 (2013) - [j73]József Balogh, Graeme Kemkes, Choongbum Lee, Stephen J. Young:
Towards a Weighted Version of the Hajnal-Szemerédi Theorem. Comb. Probab. Comput. 22(3): 346-350 (2013) - [j72]József Balogh, Alexandr V. Kostochka, Andrei M. Raigorodskii:
Coloring some finite sets in Rn . Discuss. Math. Graph Theory 33(1): 25-31 (2013) - [j71]József Balogh, Cory Palmer:
On the Tree Packing Conjecture. SIAM J. Discret. Math. 27(4): 1995-2006 (2013) - 2012
- [j70]József Balogh, Dhruv Mubayi:
Almost all triangle-free triple systems are tripartite. Comb. 32(2): 143-169 (2012) - [j69]József Balogh, András Pluhár:
The Positive Minimum Degree Game on Sparse Graphs. Electron. J. Comb. 19(1): 22 (2012) - [j68]József Balogh, Choongbum Lee, Wojciech Samotij:
Corrádi and Hajnal's Theorem for Sparse Random Graphs. Comb. Probab. Comput. 21(1-2): 23-55 (2012) - [j67]József Balogh, Béla Bollobás, Robert Morris, Oliver Riordan:
Linear algebra and bootstrap percolation. J. Comb. Theory, Ser. A 119(6): 1328-1335 (2012) - [j66]József Balogh, Béla Bollobás, Robert Morris:
Graph bootstrap percolation. Random Struct. Algorithms 41(4): 413-440 (2012) - [j65]József Balogh, Tom Bohman, Béla Bollobás, Yi Zhao:
Turán Densities of Some Hypergraphs Related to Kk+1k. SIAM J. Discret. Math. 26(4): 1609-1617 (2012) - [i1]József Balogh, Hernán González-Aguilar, Gelasio Salazar:
Large convex holes in random point sets. CoRR abs/1206.0805 (2012) - 2011
- [j64]József Balogh, Wojciech Samotij:
The number of Km, m-free graphs. Comb. 31(2): 131-150 (2011) - [j63]József Balogh, Wojciech Samotij:
On the Chvátal-Erdös Triangle Game. Electron. J. Comb. 18(1) (2011) - [j62]József Balogh, Alexandr V. Kostochka:
Large minors in graphs with given independence number. Discret. Math. 311(20): 2203-2215 (2011) - [j61]József Balogh, John Lenz, Hehui Wu:
Complete minors, independent sets, and chordal graphs. Discuss. Math. Graph Theory 31(4): 639-674 (2011) - [j60]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) - [j59]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) - [j58]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) - [j57]József Balogh, Wojciech Samotij:
The number of Ks, t-free graphs. J. Lond. Math. Soc. 83(2): 368-388 (2011) - [j56]József Balogh, Jane Butterfield:
Excluding induced subgraphs: Critical graphs. Random Struct. Algorithms 38(1-2): 100-120 (2011) - [j55]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) - 2010
- [j54]József Balogh, Béla Csaba, Martin Pei, Wojciech Samotij:
Large Bounded Degree Trees in Expanding Graphs. Electron. J. Comb. 17(1) (2010) - [j53]József Balogh, Béla Bollobás, Robert Morris:
Bootstrap Percolation in High Dimensions. Comb. Probab. Comput. 19(5-6): 643-692 (2010) - [j52]József Balogh, Jane Butterfield:
Online Ramsey games for triangles in random graphs. Discret. Math. 310(24): 3653-3657 (2010) - [j51]József Balogh, Wojciech Samotij:
Almost All C4-Free Graphs Have Fewer than (1-epsilon), ex(n, C4) Edges. SIAM J. Discret. Math. 24(3): 1011-1018 (2010)
2000 – 2009
- 2009
- [j50]József Balogh, Béla Bollobás, Robert Morris:
Majority Bootstrap Percolation on the Hypercube. Comb. Probab. Comput. 18(1-2): 17-51 (2009) - [j49]Noga Alon, József Balogh, Alexandr V. Kostochka, Wojciech Samotij:
Sizes of Induced Subgraphs of Ramsey Graphs. Comb. Probab. Comput. 18(4): 459-476 (2009) - [j48]József Balogh, Tom Bohman, Dhruv Mubayi:
Erdos-Ko-Rado in Random Hypergraphs. Comb. Probab. Comput. 18(5): 629-646 (2009) - [j47]József Balogh, Alexandr V. Kostochka, Noah Prince, Michael Stiebitz:
The Erdos-Lovász Tihany conjecture for quasi-line graphs. Discret. Math. 309(12): 3985-3991 (2009) - [j46]József Balogh, Noah Prince:
Minimum Difference Representations of Graphs. Graphs Comb. 25(5): 647-655 (2009) - [j45]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) - [j44]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) - [j43]József Balogh, Ryan R. Martin, András Pluhár:
The diameter game. Random Struct. Algorithms 35(3): 369-389 (2009) - [j42]József Balogh, Ryan R. Martin:
On Avoider-Enforcer Games. SIAM J. Discret. Math. 23(2): 901-908 (2009) - 2008
- [j41]József Balogh, Ryan R. Martin:
Edit Distance and its Computation. Electron. J. Comb. 15(1) (2008) - [j40]József Balogh, Clifford D. Smyth:
On the variance of Shannon products of graphs. Discret. Appl. Math. 156(1): 110-118 (2008) - [j39]József Balogh, Alexandr V. Kostochka:
On 2-Detour Subgraphs of the Hypercube. Graphs Comb. 24(4): 265-272 (2008) - [j38]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) - [j37]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) - [j36]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 Kn. J. Comb. Theory, Ser. A 115(7): 1257-1264 (2008) - [j35]József Balogh, Stephen G. Hartke, Qi Liu, Gexin Yu:
On the First-Fit Chromatic Number of Graphs. SIAM J. Discret. Math. 22(3): 887-900 (2008) - [j34]József Balogh, Sergei L. Bezrukov, L. H. Harper, Ákos Seress:
On the bandwidth of 3-dimensional Hamming graphs. Theor. Comput. Sci. 407(1-3): 488-495 (2008) - [j33]Santosh Kumar, Ten-Hwang Lai, József Balogh:
On k-coverage in a mostly sleeping sensor network. Wirel. Networks 14(3): 277-294 (2008) - 2007
- [j32]József Balogh, Jesús Leaños, Shengjun Pan, R. Bruce Richter, Gelasio Salazar:
The convex hull of every optimal pseudolinear drawing of Kn is a triangle. Australas. J Comb. 38: 155-162 (2007) - [j31]József Balogh, Béla Bollobás, Robert Morris:
Hereditary Properties of Tournaments. Electron. J. Comb. 14(1) (2007) - [j30]József Balogh, Béla Bollobás, Robert Morris:
Hereditary properties of combinatorial structures: Posets and oriented graphs. J. Graph Theory 56(4): 311-332 (2007) - [j29]József Balogh, Boris G. 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) - [j28]József Balogh, Boris G. Pittel:
Bootstrap percolation on the random regular graph. Random Struct. Algorithms 30(1-2): 257-286 (2007) - [j27]József Balogh, Robin Pemantle:
The Klee-Minty random edge chain moves with linear speed. Random Struct. Algorithms 30(4): 464-483 (2007) - [j26]Maria Axenovich, József Balogh:
Graphs Having Small Number of Sizes on Induced k-Subgraphs. SIAM J. Discret. Math. 21(1): 264-272 (2007) - 2006
- [j25]József Balogh, Yuval Peres, Gábor Pete:
Bootstrap Percolation on Infinite Trees and Non-Amenable Groups. Comb. Probab. Comput. 15(5): 715-730 (2006) - [j24]József Balogh, Gelasio Salazar:
k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn. Discret. Comput. Geom. 35(4): 671-690 (2006) - [j23]József Balogh:
A remark on the number of edge colorings of graphs. Eur. J. Comb. 27(4): 565-573 (2006) - [j22]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) - [j21]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) - [j20]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) - 2005
- [j19]József Balogh, Béla Bollobás:
Unavoidable Traces Of Set Systems. Comb. 25(6): 633-643 (2005) - [j18]József Balogh, Béla Bollobás:
Hereditary properties of words. RAIRO Theor. Informatics Appl. 39(1): 49-65 (2005) - [j17]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) - [j16]József Balogh, Peter Keevash, Benny Sudakov:
Disjoint representability of sets and their complements. J. Comb. Theory, Ser. B 95(1): 12-28 (2005) - [j15]