researcher

J. Balogh

131 papers hereh-index 396k citations235 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position

first author117
middle author10

Across the 127 of 131 papers where every author was matched, so the position is known.

fields

math.CO125
math.PR5
cs.CG1

same name

J. Balogh — 8 papers, h 12
J. Balogh — 4 papers, h 15
J. Balogh — 1 paper, h 11
J. Balogh — 1 paper
J. Balogh — 1 paper, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity

20032024

most citedBootstrap percolation in three dimensions

105 citations · 718 across the 103 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

math.CO2024

On the maximum number of $r$ -cliques in graphs free of complete $r$ -partite subgraphs

József Balogh, Suyun Jiang, Haoran Luo

We estimate the maximum possible number of cliques of size $r$ in an $n$ -vertex graph free of a fixed complete $r$ -partite graph $K_{s_{1}, s_{2}, \dots, s_{r}}$ . By viewing every $r$ -c…

math.CO2024★ 1 cited

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.…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore

Search
Researchers
Institutions

Account

Library
Chat

Data

arXiv.org
Semantic Scholar
OpenAlex
Latest RSS

About Contact Privacy Developers llms.txt openapi.json

Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.

On the maximum number of r-cliques in graphs free of complete r-partite subgraphs

Partitioning the hypercube into smaller hypercubes

On the maximum number of $r$ -cliques in graphs free of complete $r$ -partite subgraphs