Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
Erdős problem
Description:
An open or proposed mathematical problem associated with Paul Erdős, often in combinatorics or number theory.
Primary topic:
Limits and Structures in Graph Theory (32%)
Related topics:
Limits and Structures in Graph Theory (32%),
Analytic Number Theory Research (29%),
Advanced Combinatorial Mathematics (9%)
OpenAlex ID:
keywords/erdos-problem
On the Random Series ∑± λ n (an Erdos Problem)
1995
·
Boris Solomyak
·
Annals of Mathematics
·
408
Crossing Numbers and Hard Erdős Problems in Discrete Geometry
1997
·
LÁSZLÓ A. SZÉKELY
·
Combinatorics Probability Computing
·
367
On size Ramsey number of paths, trees, and circuits. I
1983
·
JóZsef Beck
·
Journal of Graph Theory
·
159
Sufficient Conditions for Circuits in Graphs†
1972
·
D. R. Woodall
·
Proceedings of the London Mathematical Society
·
158
On the number of graphs without 4-cycles
1982
·
Daniel J. Kleitman
, Kenneth J. Winston
·
Discrete Mathematics
·
156
Bipartite subgraphs
1996
·
Noga Alon
·
COMBINATORICA
·
121
Small Ball Probability, Inverse Theorems, and Applications
2013
·
Hoi H. Nguyen
, Van H. Vu
·
Bolyai Society mathematical studies
·
120
PDF
Triangle-free intersection graphs of line segments with large chromatic number
2013
·
Arkadiusz Pawlik
, Jakub Kozik
, et al.
·
Journal of Combinatorial Theory Series B
·
115
Cliques and cycles in distance graphs and graphs of diameters
2014
·
Andrei Raigorodskii
·
Contemporary mathematics - American Mathematical Society
·
107
A survey of Sylvester's problem and its generalizations
1990
·
P. Borwein
, W. O. J. Moser
·
Aequationes Mathematicae
·
98
A Partition Property of Simplices in Euclidean Space
1990
·
P. Frankl
, V. Rödl
·
Journal of the American Mathematical Society
·
95
PDF
Triangle-free intersection graphs of line segments with large chromatic number
·
Arkadiusz Pawlik
, Jakub Kozik
, et al.
·
86
A combinatorial property and power graphs of semigroups
2004
·
Andrei Kelarev
, Stephen J. Quinn
·
eCite Digital Repository (University of Tasmania)
·
78
The Number of Pairwise Non-Commuting Elements and the Index of the Centre in a Finite Group
1987
·
L. Pyber
·
Journal of the London Mathematical Society
·
66
On Subsets with Intersections of Even Cardinality
1969
·
E.R. Berlekamp
·
Canadian Mathematical Bulletin
·
62
PDF
Triangles in an Ordinary Graph
1963
·
E. A. Nordhaus
, B. M. Stewart
·
Canadian Journal of Mathematics
·
62
PDF
On a Problem of Erdos
1950
·
Hansraj Gupta
·
American Mathematical Monthly
·
62
Advancing mathematics research with AI-driven formal proof search
2026
·
George Tsoukalas
, Anton Kovsharov
, et al.
·
Science
·
60
PDF
On a Tur�n type problem of Erd�s
1991
·
Zolt�n F�redi
·
COMBINATORICA
·
60
Two Erdős problems on lacunary sequences: Chromatic number and Diophantine approximation
2010
·
Yuval Peres
, Wilhelm Schlag
·
Bulletin of the London Mathematical Society
·
59
PDF
Semi-Autonomous Mathematics Discovery with Gemini: A Case Study on the Erdős Problems
2026
·
Feng, Tony
, Trinh, Trieu
, et al.
·
arXiv (Cornell University)
·
57
PDF
An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
2014
·
ANDRZEJ DUDEK
, PAWEŁ PRAŁAT
·
Combinatorics Probability Computing
·
56
PDF
An extension of the Landau-Kolmogorov inequality. Solution of a problem of Erdös
1999
·
Borislav Bojanov
, Nikola Naidenov
·
Journal d Analyse Mathématique
·
56
Open problems of Paul Erd�s in graph theory
1997
·
F. R. K. Chung
·
Journal of Graph Theory
·
56
On the almost everywhere divergence of Lagrange interpolatory polynomials for arbitrary system of nodes
1980
·
P. Erdős
, P. Vértesi
·
Acta Mathematica Academiae Scientiarum Hungaricae
·
55
Show more works
View as search
Works count:
500
Citation count:
4,976
Year
Topic
Type