József Balogh

According to our database1, József Balogh authored at least 132 papers between 1998 and 2022.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


A strengthening of the Erdős-Szekeres Theorem.
Eur. J. Comb., 2022

On the sizes of large subgraphs of the binomial random graph.
Discret. Math., 2022

Generalized rainbow Turán numbers of odd cycles.
Discret. Math., 2022

Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree.
Comb. Probab. Comput., 2022

Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree.
SIAM J. Discret. Math., 2021

Independent sets in the middle two layers of Boolean lattice.
J. Comb. Theory, Ser. A, 2021

Counting independent sets in regular hypergraphs.
J. Comb. Theory, Ser. A, 2021

The domination number of the graph defined by two levels of the n-cube, II.
Eur. J. Comb., 2021

An analogue of the Erdős-Gallai theorem for random graphs.
Eur. J. Comb., 2021

A discrepancy version of the Hajnal-Szemerédi theorem.
Comb. Probab. Comput., 2021

Making Kr+1-free graphs r-partite.
Comb. Probab. Comput., 2021

An upper bound on the size of Sidon sets.
CoRR, 2021

On the Number of Sum-Free Triplets of Sets.
Electron. J. Comb., 2021

Families in posets minimizing the number of comparable pairs.
J. Graph Theory, 2020

On the number of linear hypergraphs of large girth.
J. Graph Theory, 2020

Ordered size Ramsey number of paths.
Discret. Appl. Math., 2020

The Ramsey Number of Fano Plane Versus Tight Path.
Electron. J. Comb., 2020

On the Discrepancies of Graphs.
Electron. J. Comb., 2020

Closing in on Hill's Conjecture.
SIAM J. Discret. Math., 2019

The Typical Structure of Gallai Colorings and Their Extremal Graphs.
SIAM J. Discret. Math., 2019

The number of hypergraphs without linear cycles.
J. Comb. Theory, Ser. B, 2019

Packing Chromatic Number of Subdivisions of Cubic Graphs.
Graphs Comb., 2019

Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs.
Eur. J. Comb., 2019

Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs.
Eur. J. Comb., 2019

Tilings in Randomly Perturbed Dense Graphs.
Comb. Probab. Comput., 2019

Monochromatic Hilbert Cubes and Arithmetic Progressions.
Electron. J. Comb., 2019

Cubic Graphs with Small Independence Ratio.
Electron. J. Comb., 2019

Structure and Supersaturation for Intersecting Families.
Electron. J. Comb., 2019

Packing chromatic number of cubic graphs.
Discret. Math., 2018

Two results about the hypercube.
Discret. Appl. Math., 2018

Rainbow spanning trees in properly coloured complete graphs.
Discret. Appl. Math., 2018

Triangle-Tilings in Graphs Without Large Independent Sets.
Comb. Probab. Comput., 2018

On Two Problems in Ramsey-Turán Theory.
SIAM J. Discret. Math., 2017

Transitive triangle tilings in oriented graphs.
J. Comb. Theory, Ser. B, 2017

Rainbow triangles in three-colored graphs.
J. Comb. Theory, Ser. B, 2017

Stability for Vertex Cycle Covers.
Electron. J. Comb., 2017

The typical structure of graphs with no large cliques.
Comb., 2017

Applications of graph containers in the Boolean lattice.
Random Struct. Algorithms, 2016

Triangle factors of graphs without large independent sets and of weighted graphs.
Random Struct. Algorithms, 2016

Mantel's theorem for random hypergraphs.
Random Struct. Algorithms, 2016

Hypergraphs with Zero Chromatic Threshold.
Graphs Comb., 2016

Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle.
Eur. J. Comb., 2016

Rainbow copies of C<sub>4</sub> in edge-colored hypercubes.
Discret. Appl. Math., 2016

On the path separation number of graphs.
Discret. Appl. Math., 2016

On the Chromatic Thresholds of Hypergraphs.
Comb. Probab. Comput., 2016

Book Embeddings of Regular Graphs.
SIAM J. Discret. Math., 2015

On the Decay of Crossing Numbers of Sparse Graphs.
J. Graph Theory, 2015

Subdivisions of a large clique in C6-free graphs.
J. Comb. Theory, Ser. B, 2015

Phase transitions in Ramsey-Turán theory.
J. Comb. Theory, Ser. B, 2015

Intersecting families of discrete structures are typically trivial.
J. Comb. Theory, Ser. A, 2015

A sharp bound on the number of maximal sum-free sets.
Electron. Notes Discret. Math., 2015

Minimum Number of Monotone Subsequences of Length 4 in Permutations.
Comb. Probab. Comput., 2015

A random version of Sperner's theorem.
J. Comb. Theory, Ser. A, 2014

On the number of K<sub>4</sub>-saturating edges.
J. Comb. Theory, Ser. B, 2014

Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube.
Eur. J. Comb., 2014

Partitioning 2-edge-colored graphs by monochromatic paths and cycles.
Comb., 2014

On the Tree Packing Conjecture.
SIAM J. Discret. Math., 2013

Coloring some finite sets in <i> R<sup>n</sup> </i>.
Discuss. Math. Graph Theory, 2013

Towards a Weighted Version of the Hajnal-Szemerédi Theorem.
Comb. Probab. Comput., 2013

Large convex holes in random point sets.
Comput. Geom., 2013

On Perfect Packings in Dense Graphs.
Electron. J. Comb., 2013

Turán Densities of Some Hypergraphs Related to K<sub>k+1</sub><sup>k</sup>.
SIAM J. Discret. Math., 2012

Graph bootstrap percolation.
Random Struct. Algorithms, 2012

Linear algebra and bootstrap percolation.
J. Comb. Theory, Ser. A, 2012

Corrádi and Hajnal's Theorem for Sparse Random Graphs.
Comb. Probab. Comput., 2012

The Positive Minimum Degree Game on Sparse Graphs.
Electron. J. Comb., 2012

Almost all triangle-free triple systems are tripartite.
Comb., 2012

Local resilience of almost spanning trees in random graphs.
Random Struct. Algorithms, 2011

Excluding induced subgraphs: Critical graphs.
Random Struct. Algorithms, 2011

The number of <i>K</i><sub><i>s, t</i></sub>-free graphs.
J. Lond. Math. Soc., 2011

Almost all triple systems with independent neighborhoods are semi-bipartite.
J. Comb. Theory, Ser. A, 2011

The fine structure of octahedron-free graphs.
J. Comb. Theory, Ser. B, 2011

The structure of almost all graphs in a hereditary property.
J. Comb. Theory, Ser. B, 2011

Complete minors, independent sets, and chordal graphs.
Discuss. Math. Graph Theory, 2011

Large minors in graphs with given independence number.
Discret. Math., 2011

On the Chvátal-Erdös Triangle Game.
Electron. J. Comb., 2011

The number of <i>K</i><sub><i>m, m</i></sub>-free graphs.
Comb., 2011

Almost All C<sub>4</sub>-Free Graphs Have Fewer than (1-epsilon), ex(n, C<sub>4</sub>) Edges.
SIAM J. Discret. Math., 2010

Online Ramsey games for triangles in random graphs.
Discret. Math., 2010

Bootstrap Percolation in High Dimensions.
Comb. Probab. Comput., 2010

Large Bounded Degree Trees in Expanding Graphs.
Electron. J. Comb., 2010

On Avoider-Enforcer Games.
SIAM J. Discret. Math., 2009

The diameter game.
Random Struct. Algorithms, 2009

The typical structure of graphs without given excluded subgraphs.
Random Struct. Algorithms, 2009

The unlabelled speed of a hereditary graph property.
J. Comb. Theory, Ser. B, 2009

Minimum Difference Representations of Graphs.
Graphs Comb., 2009

The Erdos-Lovász Tihany conjecture for quasi-line graphs.
Discret. Math., 2009

Erdos-Ko-Rado in Random Hypergraphs.
Comb. Probab. Comput., 2009

Majority Bootstrap Percolation on the Hypercube.
Comb. Probab. Comput., 2009

Sizes of Induced Subgraphs of Ramsey Graphs.
Comb. Probab. Comput., 2009

On k-coverage in a mostly sleeping sensor network.
Wirel. Networks, 2008

On the bandwidth of 3-dimensional Hamming graphs.
Theor. Comput. Sci., 2008

On the First-Fit Chromatic Number of Graphs.
SIAM J. Discret. Math., 2008

A new short proof of a theorem of Ahlswede and Khachatrian.
J. Comb. Theory, Ser. A, 2008

An extended lower bound on the number of (k)-edges to generalized configurations of points and the pseudolinear crossing number of K<sub>n</sub>.
J. Comb. Theory, Ser. A, 2008

A note on harmonic subgraphs in labelled geometric graphs.
Inf. Process. Lett., 2008

On 2-Detour Subgraphs of the Hypercube.
Graphs Comb., 2008

On the variance of Shannon products of graphs.
Discret. Appl. Math., 2008

Edit Distance and its Computation.
Electron. J. Comb., 2008

Graphs Having Small Number of Sizes on Induced k-Subgraphs.
SIAM J. Discret. Math., 2007

Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position.
Random Struct. Algorithms, 2007

The Klee-Minty random edge chain moves with linear speed.
Random Struct. Algorithms, 2007

Bootstrap percolation on the random regular graph.
Random Struct. Algorithms, 2007

Hereditary properties of combinatorial structures: Posets and oriented graphs.
J. Graph Theory, 2007

Hereditary Properties of Tournaments.
Electron. J. Comb., 2007

The convex hull of every optimal pseudolinear drawing of K<sub>n</sub> is a triangle.
Australas. J Comb., 2007

On the edge-bandwidth of graph products.
Theor. Comput. Sci., 2006

On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs.
J. Comb. Theory, Ser. B, 2006

Hereditary properties of partitions, ordered graphs and ordered hypergraphs.
Eur. J. Comb., 2006

A remark on the number of edge colorings of graphs.
Eur. J. Comb., 2006

k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of K<sub>n</sub>.
Discret. Comput. Geom., 2006

Bootstrap Percolation on Infinite Trees and Non-Amenable Groups.
Comb. Probab. Comput., 2006

Disjoint representability of sets and their complements.
J. Comb. Theory, Ser. B, 2005

Covering planar graphs with forests.
J. Comb. Theory, Ser. B, 2005

A jump to the bell number for hereditary graph properties.
J. Comb. Theory, Ser. B, 2005

Hereditary properties of words.
RAIRO Theor. Informatics Appl., 2005

Unavoidable Traces Of Set Systems.
Comb., 2005

Index assignment for two-channel quantization.
IEEE Trans. Inf. Theory, 2004

On the interval number of special graphs.
J. Graph Theory, 2004

The number of graphs without forbidden subgraphs.
J. Comb. Theory, Ser. B, 2004

Long Monotone Paths in Line Arrangements.
Discret. Comput. Geom., 2004

Improved Bounds for the Number of (<=k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of K<sub>n</sub>.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

Private computation using a PEZ dispenser.
Theor. Comput. Sci., 2003

The Turan Density of Triple Systems Is Not Principal.
J. Comb. Theory, Ser. A, 2002

The interval number of dense graphs.
Discret. Math., 2002

Game domination number.
Discret. Math., 2002

Measures on monotone properties of graphs.
Discret. Appl. Math., 2002

The Penultimate Rate of Growth for Graph Properties.
Eur. J. Comb., 2001

The Speed of Hereditary Properties of Graphs.
J. Comb. Theory, Ser. B, 2000

A sharp edge bound on the interval number of a graph.
J. Graph Theory, 1999

A Parallelized Sequential Random Search Global Optimization Algorithm.
Acta Cybern., 1999

Random disease on the square grid.
Random Struct. Algorithms, 1998