József Balogh

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 67

Top Venues

Eur. J. Comb.

J. Comb. Theory, Ser. B

Comb. Probab. Comput.

Electron. J. Comb.

Publications

Igor Araujo, József Balogh, Robert A. Krueger, Simón Piga, Andrew Treglown
On oriented cycles in randomly perturbed digraphs. Comb. Probab. Comput. 33 (2) (2024)
József Balogh, Ramon Garcia, Lina Li, Adam Zsolt Wagner
Intersecting families of sets are typically trivial. J. Comb. Theory, Ser. B 164 (2024)
József Balogh, Felix Christian Clemen, Bernard Lidický
10 problems for partitions of triangle-free graphs. Eur. J. Comb. 121 (2024)
József Balogh, Ce Chen, Grace McCourt, Cassie Murley
Ramsey-Turán problems with small independence numbers. Eur. J. Comb. 118 (2024)
József Balogh, Ethan Patrick White
Grid-drawings of graphs in three-dimensions. CoRR (2024)
József Balogh, Ce Chen, Kevin Hendrey, Ben Lund, Haoran Luo, Casey Tompkins, Tuan Tran
Maximal 3-Wise Intersecting Families. Comb. 43 (6) (2023)
József Balogh, Robert A. Krueger, Haoran Luo
Sharp threshold for the Erdős-Ko-Rado theorem. Random Struct. Algorithms 62 (1) (2023)
Igor Araújo, József Balogh, Haoran Luo
On the Maximum $F_5$-Free Subhypergraphs of a Random Hypergraph. Electron. J. Comb. 30 (4) (2023)
József Balogh, Bernard Lidický, Sergey Norin, Florian Pfender, Gelasio Salazar, Sam Spiro
Crossing numbers of complete bipartite graphs. LAGOS (2023)
József Balogh, Felix Christian Clemen, Adrian Dumitrescu
On a Traveling Salesman Problem for Points in the Unit Cube. CoRR (2023)
József Balogh, Sean English, Emily Heath, Robert A. Krueger
Lower bounds on the Erdős-Gyárfás problem via color energy graphs. J. Graph Theory 103 (2) (2023)
József Balogh, Dingding Dong, Bernard Lidický, Nitya Mani, Yufei Zhao
Nearly All k-SAT Functions Are Unate. STOC (2023)
József Balogh, Zoltán Füredi, Souktik Roy
An Upper Bound on the Size of Sidon Sets. Am. Math. Mon. 130 (5) (2023)
József Balogh, Felix Christian Clemen, Bernard Lidický, Sergey Norin, Jan Volec
The Spectrum of Triangle-Free Graphs. SIAM J. Discret. Math. 37 (2) (2023)
József Balogh, The Nguyen, Patric R. J. Östergård, Ethan Patrick White, Michael C. Wigal
Improving Uniquely Decodable Codes in Binary Adder Channels. CoRR (2023)
Margarita Akhmejanova, József Balogh, Dmitrii Shabanov
Chain method for panchromatic colorings of hypergraphs. Discret. Appl. Math. 321 (2022)
József Balogh, Felix Christian Clemen, Bernard Lidický
Maximum number of almost similar triangles in the plane. Comput. Geom. (2022)
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) (2022)
József Balogh, Lina Li, Andrew Treglown
Tilings in vertex ordered graphs. J. Comb. Theory, Ser. B 155 (2022)
József Balogh, Michelle Delcourt, Emily Heath, Lina Li
Generalized rainbow Turán numbers of odd cycles. Discret. Math. 345 (2) (2022)
József Balogh, Felix Christian Clemen, Letícia Mattos
-graphs without forbidden configurations. J. Comb. Theory, Ser. B 157 (2022)
József Balogh, Maksim Zhukovskii
On the sizes of large subgraphs of the binomial random graph. Discret. Math. 345 (2) (2022)
József Balogh, Alexandr V. Kostochka, Mikhail Lavrov, Xujun Liu
Monochromatic connected matchings in 2-edge-colored multipartite graphs. J. Graph Theory 100 (3) (2022)
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. Discret. Math. 36 (2) (2022)
József Balogh, Felix Christian Clemen, Emily Heath, Mikhail Lavrov
A strengthening of the Erdős-Szekeres Theorem. Eur. J. Comb. 101 (2022)
József Balogh, Dingding Dong, Bernard Lidický, Nitya Mani, Yufei Zhao
Nearly all k-SAT functions are unate. CoRR (2022)
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) (2021)
József Balogh, Béla Bollobás, Bhargav P. Narayanan
Counting independent sets in regular hypergraphs. J. Comb. Theory, Ser. A 180 (2021)
József Balogh, Ramon Garcia, Lina Li
Independent sets in the middle two layers of Boolean lattice. J. Comb. Theory, Ser. A 178 (2021)
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 (2021)
Igor Araújo, József Balogh, Ramon Garcia
On the Number of Sum-Free Triplets of Sets. Electron. J. Comb. 28 (4) (2021)
József Balogh, Nathan Lemons, Cory Palmer
Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree. SIAM J. Discret. Math. 35 (3) (2021)
József Balogh, Zoltán Füredi, Souktik Roy
An upper bound on the size of Sidon sets. CoRR (2021)
József Balogh, Felix Christian Clemen, Mikhail Lavrov, Bernard Lidický, Florian Pfender
Making Kr+1-free graphs r-partite. Comb. Probab. Comput. 30 (4) (2021)
József Balogh, Andrzej Dudek, Lina Li
An analogue of the Erdős-Gallai theorem for random graphs. Eur. J. Comb. 91 (2021)
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) (2020)
József Balogh, Béla Csaba, Yifan Jing, András Pluhár
On the Discrepancies of Graphs. Electron. J. Comb. 27 (2) (2020)
József Balogh, Lina Li
On the number of linear hypergraphs of large girth. J. Graph Theory 93 (1) (2020)
József Balogh, Sárka Petrícková, Adam Zsolt Wagner
Families in posets minimizing the number of comparable pairs. J. Graph Theory 95 (4) (2020)
József Balogh, Felix Christian Clemen, Emily Heath, Mikhail Lavrov
Ordered size Ramsey number of paths. Discret. Appl. Math. 276 (2020)
József Balogh, Theodore Molla
Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs. Eur. J. Comb. 79 (2019)
József Balogh, Danila D. Cherkashin, Sergei Kiselev
Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs. Eur. J. Comb. 79 (2019)
József Balogh, Lina Li
The Typical Structure of Gallai Colorings and Their Extremal Graphs. SIAM J. Discret. Math. 33 (4) (2019)
József Balogh, Bernard Lidický, Gelasio Salazar
Closing in on Hill's Conjecture. SIAM J. Discret. Math. 33 (3) (2019)
József Balogh, Mikhail Lavrov, George Shakan, Adam Zsolt Wagner
Monochromatic Hilbert Cubes and Arithmetic Progressions. Electron. J. Comb. 26 (2) (2019)
József Balogh, Andrew Treglown, Zsolt Adam Wagner
Tilings in Randomly Perturbed Dense Graphs. Comb. Probab. Comput. 28 (2) (2019)
József Balogh, Shagnik Das, Hong Liu, Maryam Sharifzadeh, Tuan Tran
Structure and Supersaturation for Intersecting Families. Electron. J. Comb. 26 (2) (2019)
József Balogh, Alexandr V. Kostochka, Xujun Liu
Packing Chromatic Number of Subdivisions of Cubic Graphs. Graphs Comb. 35 (2) (2019)
József Balogh, Bhargav P. Narayanan, Jozef Skokan
The number of hypergraphs without linear cycles. J. Comb. Theory, Ser. B 134 (2019)
József Balogh, Alexandr V. Kostochka, Xujun Liu
Cubic Graphs with Small Independence Ratio. Electron. J. Comb. 26 (1) (2019)
József Balogh, Andrew McDowell, Theodore Molla, Richard Mycroft
Triangle-Tilings in Graphs Without Large Independent Sets. Comb. Probab. Comput. 27 (4) (2018)
József Balogh, Alexandr V. Kostochka, Xujun Liu
Packing chromatic number of cubic graphs. Discret. Math. 341 (2) (2018)
József Balogh, Tamás Mészáros, Zsolt Adam Wagner
Two results about the hypercube. Discret. Appl. Math. 247 (2018)
József Balogh, Hong Liu, Richard Montgomery
Rainbow spanning trees in properly coloured complete graphs. Discret. Appl. Math. 247 (2018)
József Balogh, Allan Lo, Theodore Molla
Transitive triangle tilings in oriented graphs. J. Comb. Theory, Ser. B 124 (2017)
József Balogh, Frank Mousset, Jozef Skokan
Stability for Vertex Cycle Covers. Electron. J. Comb. 24 (3) (2017)
József Balogh, Hong Liu, Maryam Sharifzadeh
On Two Problems in Ramsey-Turán Theory. SIAM J. Discret. Math. 31 (3) (2017)
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 (2017)
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) (2017)
József Balogh, Béla Csaba, Ryan R. Martin, András Pluhár
On the path separation number of graphs. Discret. Appl. Math. 213 (2016)
József Balogh, Jane Butterfield, Ping Hu, John Lenz, Dhruv Mubayi
On the Chromatic Thresholds of Hypergraphs. Comb. Probab. Comput. 25 (2) (2016)
József Balogh, John Lenz
Hypergraphs with Zero Chromatic Threshold. Graphs Comb. 32 (4) (2016)
József Balogh, Theodore Molla, Maryam Sharifzadeh
Triangle factors of graphs without large independent sets and of weighted graphs. Random Struct. Algorithms 49 (4) (2016)
József Balogh, Michelle Delcourt, Bernard Lidický, Cory Palmer
in edge-colored hypercubes. Discret. Appl. Math. 210 (2016)
József Balogh, Jane Butterfield, Ping Hu, John Lenz
Mantel's theorem for random hypergraphs. Random Struct. Algorithms 48 (4) (2016)
József Balogh, Andrew Treglown, Zsolt Adam Wagner
Applications of graph containers in the Boolean lattice. Random Struct. Algorithms 49 (4) (2016)
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 (2016)
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) (2015)
József Balogh, Hong Liu, Maryam Sharifzadeh
Subdivisions of a large clique in C6-free graphs. J. Comb. Theory, Ser. B 112 (2015)
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 (2015)
József Balogh, Gelasio Salazar
Book Embeddings of Regular Graphs. SIAM J. Discret. Math. 29 (2) (2015)
József Balogh, Ping Hu, Miklós Simonovits
Phase transitions in Ramsey-Turán theory. J. Comb. Theory, Ser. B 114 (2015)
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 (2015)
József Balogh, Jesús Leaños, Gelasio Salazar
On the Decay of Crossing Numbers of Sparse Graphs. J. Graph Theory 80 (3) (2015)
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 (2014)
József Balogh, Richard Mycroft, Andrew Treglown
A random version of Sperner's theorem. J. Comb. Theory, Ser. A 128 (2014)
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) (2014)
József Balogh, Hong Liu
-saturating edges. J. Comb. Theory, Ser. B 109 (2014)
József Balogh, Hernán González-Aguilar, Gelasio Salazar
Large convex holes in random point sets. Comput. Geom. 46 (6) (2013)
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) (2013)
József Balogh, Alexandr V. Kostochka, Andrew Treglown
On Perfect Packings in Dense Graphs. Electron. J. Comb. 20 (1) (2013)
József Balogh, Cory Palmer
On the Tree Packing Conjecture. SIAM J. Discret. Math. 27 (4) (2013)
József Balogh, Alexandr V. Kostochka, Andrei M. Raigorodskii
. Discuss. Math. Graph Theory 33 (1) (2013)
József Balogh, András Pluhár
The Positive Minimum Degree Game on Sparse Graphs. Electron. J. Comb. 19 (1) (2012)
József Balogh, Tom Bohman, Béla Bollobás, Yi Zhao
. SIAM J. Discret. Math. 26 (4) (2012)
József Balogh, Béla Bollobás, Robert Morris
Graph bootstrap percolation. Random Struct. Algorithms 41 (4) (2012)
József Balogh, Hernán González-Aguilar, Gelasio Salazar
Large convex holes in random point sets CoRR (2012)
József Balogh, Béla Bollobás, Robert Morris, Oliver Riordan
Linear algebra and bootstrap percolation. J. Comb. Theory, Ser. A 119 (6) (2012)
József Balogh, Choongbum Lee, Wojciech Samotij
Corrádi and Hajnal's Theorem for Sparse Random Graphs. Comb. Probab. Comput. 21 (1-2) (2012)
József Balogh, Dhruv Mubayi
Almost all triangle-free triple systems are tripartite. Comb. 32 (2) (2012)
József Balogh, Béla Bollobás, Miklós Simonovits
The fine structure of octahedron-free graphs. J. Comb. Theory, Ser. B 101 (2) (2011)
József Balogh, Wojciech Samotij
-free graphs. J. Lond. Math. Soc. 83 (2) (2011)
József Balogh, Béla Csaba, Wojciech Samotij
Local resilience of almost spanning trees in random graphs. Random Struct. Algorithms 38 (1-2) (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) (2011)
József Balogh, John Lenz, Hehui Wu
Complete minors, independent sets, and chordal graphs. Discuss. Math. Graph Theory 31 (4) (2011)
József Balogh, Jane Butterfield
Excluding induced subgraphs: Critical graphs. Random Struct. Algorithms 38 (1-2) (2011)
József Balogh, Alexandr V. Kostochka
Large minors in graphs with given independence number. Discret. Math. 311 (20) (2011)
József Balogh, Dhruv Mubayi
Almost all triple systems with independent neighborhoods are semi-bipartite. J. Comb. Theory, Ser. A 118 (4) (2011)
József Balogh, Wojciech Samotij
On the Chvátal-Erdös Triangle Game. Electron. J. Comb. 18 (1) (2011)
József Balogh, Wojciech Samotij
-free graphs. Comb. 31 (2) (2011)

József Balogh.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

József Balogh