105 citations · 718 across the 103 of their papers we have counts for
131 papers
On the maximum number of -cliques in graphs free of complete -partite subgraphs
József Balogh, Suyun Jiang, Haoran Luo
We estimate the maximum possible number of cliques of size in an -vertex graph free of a fixed complete -partite graph . By viewing every -c…
Partitioning the hypercube into smaller hypercubes
Noga Alon, Jozsef Balogh, Vladimir N. Potapov
Denote by Q_d the d-dimensional hypercube. Addressing a recent question we estimate the number of ways the vertex set of Q_d can be partitioned into vertex disjoint smaller cubes.…
Almost Congruent Triangles
József Balogh, Felix Christian Clemen, Adrian Dumitrescu
Almost years ago Erdős and Purdy asked the following question: Given points in the plane, how many triangles can be approximate congruent to equilateral triangles? They po…
Turán density of long tight cycle minus one hyperedge
József Balogh, Haoran Luo
Denote by the -uniform hypergraph obtained by removing one hyperedge from the tight cycle on vertices. It is conjectured that the Turán density of…
Weighted Turán theorems with applications to Ramsey-Turán type of problems
József Balogh, Domagoj Bradač, Bernard Lidický
We study extensions of Turán Theorem in edge-weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique…
On oriented cycles in randomly perturbed digraphs
Igor Araujo, József Balogh, Robert A. Krueger +2
In 2003, Bohman, Frieze, and Martin initiated the study of randomly perturbed graphs and digraphs. For digraphs, they showed that for every , there exists a constant such…