4 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…
Hypergraph Turán Problems in -Norm
József Balogh, Felix Christian Clemen, Bernard Lidický
There are various different notions measuring extremality of hypergraphs. In this survey we compare the recently introduced notion of the codegree squared extremal function with th…
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.…
Intersecting families of sets are typically trivial
József Balogh, Ramon I. Garcia, Lina Li +1
A family of subsets of is intersecting if every pair of its sets intersects. Determining the structure of large intersecting families is a central problem in extremal combina…