Biography.guide
Home › People › Mathematician › János Komlós
Portrait of János Komlós

János Komlós

b. 1942

Hungarian mathematician

Don't just read it — keep itBiographies to ownE-book · Audio · Video From $7 →

About János Komlós

Born 1942. János Komlós is a Hungarian mathematician and computer scientist.

János Komlós (born 23 May 1942, in Budapest) is a Hungarian-American mathematician, working in probability theory and discrete mathematics. He has been a professor of mathematics at Rutgers University since 1988. He graduated from the Eötvös Loránd University, then became a fellow at the Mathematical Institute of the Hungarian Academy of Sciences. Between 1984–1988 he worked at the University of California, San Diego.

Notable results Komlós' theorem: He proved that every L1-bounded sequence of real functions contains a subsequence such that the arithmetic means of all its subsequences converge pointwise almost everywhere. In probabilistic terminology, the theorem is as follows. Let ξ1,ξ2... be a sequence of random variables such that E[ξ1],E[ξ2]... is bounded. Then there exist a subsequence ξ'1, ξ'2... and a random variable β such that for each further subsequence η1,η2... of ξ'0, ξ'1... we have (η1+...+ηn)/n → β a.s. With Miklós Ajtai and Endre Szemerédi he proved the ct2/log t upper bound for the Ramsey number R(3,t). The corresponding lower bound was established by Jeong Han Kim only in 1995, and this result earned him a Fulkerson Prize.

The same team of authors developed the optimal Ajtai–Komlós–Szemerédi sorting network. Komlós and Szemerédi proved that if G is a random graph on n vertices with

edges, where c is a fixed real number, then the probability that G has a Hamiltonian circuit converges to

With Gábor Sárközy and Endre Szemerédi he proved the so-called blow-up lemma which claims that the regular pairs in Szemerédi's regularity lemma are similar to complete bipartite graphs when considering the embedding of graphs with bounded degrees. Komlós worked on Heilbronn's problem; he, János Pintz and Szemerédi disproved Heilbronn's conjecture. Komlós also wrote highly cited papers on sums of random variables, space-efficient representations of sparse sets, random matrices, the Szemerédi regularity lemma, and derandomization. Together with Miklós Ajtai and Gábor Tusnády he proved in 1984 the AKT optimal matching theorem.

Degrees, awards Komlós received his Ph.D. in 1967 from Eötvös Loránd University under the supervision of Alfréd Rényi. In 1975, he received the Alfréd Rényi Prize, a prize established for researchers of the Alfréd Rényi Institute of Mathematics. In 1998, he was elected as an external member to the Hungarian Academy of Sciences.

Biography shop

Don’t just read it —
keep it.

Full-length biographies made to live with: read them, listen on the way to work, watch them tonight.

  • E-book
  • Audio
  • Video
Browse the shop — from $7

Instant download · yours to keep · every purchase keeps this site free

Important facts

Birth century
Nationality
Education
Eötvös Loránd University
Employers
Rutgers University
Awards
Rényi Alfréd Prize
Also known as
Janos Komlos

People in János Komlós's life

Named in this biography and alive at the same time

Contemporaries

People whose lives overlapped János Komlós's

Frequently asked questions

Who is János Komlós?

Hungarian mathematician

When was János Komlós born?

János Komlós was born on 23 May 1942 in Budapest.

What is János Komlós's occupation?

János Komlós is a mathematician and computer scientist.

What nationality is János Komlós?

János Komlós is Hungarian.

Sources & further reading

· Wikipedia: János Komlós

· Wikidata: Q1116241

· DBpedia: János Komlós (mathematician)

Cite this page

APA: Biography.guide. (2026). János Komlós. https://biography.guide/janos-komlos/

MLA: "János Komlós." Biography.guide, https://biography.guide/janos-komlos/.

Chicago: "János Komlós." Biography.guide. https://biography.guide/janos-komlos/.

Data last updated: 2026-09-20 · Spot an error? Report a correction.

Page generated 2026-09-27 05:29 UTC