József Balogh

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

Packing Chromatic Number of Subdivisions of Cubic Graphs.
Graphs and Combinatorics, 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.
Combinatorics, Probability & Computing, 2019

2018
Packing chromatic number of cubic graphs.
Discrete Mathematics, 2018

Two results about the hypercube.
Discrete Applied Mathematics, 2018

Rainbow spanning trees in properly coloured complete graphs.
Discrete Applied Mathematics, 2018

Triangle-Tilings in Graphs Without Large Independent Sets.
Combinatorics, Probability & Computing, 2018

2017
On Two Problems in Ramsey-Turán Theory.
SIAM J. Discrete 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.
Electr. J. Comb., 2017

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

2016
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 and Combinatorics, 2016

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

Rainbow copies of C4 in edge-colored hypercubes.
Discrete Applied Mathematics, 2016

On the path separation number of graphs.
Discrete Applied Mathematics, 2016

On the Chromatic Thresholds of Hypergraphs.
Combinatorics, Probability & Computing, 2016

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

On the Decay of Crossing Numbers of Sparse Graphs.
Journal of 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.
Electronic Notes in Discrete Mathematics, 2015

Minimum Number of Monotone Subsequences of Length 4 in Permutations.
Combinatorics, Probability & Computing, 2015

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

On the number of K4-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.
Combinatorica, 2014

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

Coloring some finite sets in Rn .
Discussiones Mathematicae Graph Theory, 2013

Towards a Weighted Version of the Hajnal-Szemerédi Theorem.
Combinatorics, Probability & Computing, 2013

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

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

2012
Turán Densities of Some Hypergraphs Related to Kk+1k.
SIAM J. Discrete 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.
Combinatorics, Probability & Computing, 2012

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

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

2011
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 Ks, t-free graphs.
J. London Math. Society, 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.
Discussiones Mathematicae Graph Theory, 2011

Large minors in graphs with given independence number.
Discrete Mathematics, 2011

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

The number of Km, m-free graphs.
Combinatorica, 2011

2010
Almost All C4-Free Graphs Have Fewer than (1-epsilon), ex(n, C4) Edges.
SIAM J. Discrete Math., 2010

Online Ramsey games for triangles in random graphs.
Discrete Mathematics, 2010

Bootstrap Percolation in High Dimensions.
Combinatorics, Probability & Computing, 2010

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

2009
On Avoider-Enforcer Games.
SIAM J. Discrete 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 and Combinatorics, 2009

The Erdos-Lovász Tihany conjecture for quasi-line graphs.
Discrete Mathematics, 2009

Erdos-Ko-Rado in Random Hypergraphs.
Combinatorics, Probability & Computing, 2009

Majority Bootstrap Percolation on the Hypercube.
Combinatorics, Probability & Computing, 2009

Sizes of Induced Subgraphs of Ramsey Graphs.
Combinatorics, Probability & Computing, 2009

2008
On the First-Fit Chromatic Number of Graphs.
SIAM J. Discrete 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 Kn.
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 and Combinatorics, 2008

On the variance of Shannon products of graphs.
Discrete Applied Mathematics, 2008

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

2007
Graphs Having Small Number of Sizes on Induced k-Subgraphs.
SIAM J. Discrete 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.
Journal of Graph Theory, 2007

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

The convex hull of every optimal pseudolinear drawing of Kn is a triangle.
Australasian J. Combinatorics, 2007

2006
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 Kn.
Discrete & Computational Geometry, 2006

Bootstrap Percolation on Infinite Trees and Non-Amenable Groups.
Combinatorics, Probability & Computing, 2006

2005
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.
ITA, 2005

Unavoidable Traces Of Set Systems.
Combinatorica, 2005

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

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

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

On k-coverage in a mostly sleeping sensor network.
Proceedings of the 10th Annual International Conference on Mobile Computing and Networking, 2004

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

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

Long monotone paths in line arrangements.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

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

The interval number of dense graphs.
Discrete Mathematics, 2002

Game domination number.
Discrete Mathematics, 2002

Measures on monotone properties of graphs.
Discrete Applied Mathematics, 2002

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

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

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

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


  Loading...