Skip to content
Toggle Sidebar
Home
Problems
Frontiers
Updates
Overview
Problem ledger
Assertions
Proposed changes
Commits
Reproduce
Add contribution
Toggle Sidebar
Vela Mathematics Program
/
Problems
Search or jump
⌘K
Problems · Vela Mathematics Program
Narrowed to
turan number ×
source:vibemathed ×
Clear all
Subject tag
number theory
80
analysis
16
geometry
14
graph theory
13
additive combinatorics
11
distances
8
chromatic number
7
additive basis
6
›
24 more subjects
covering systems
6
primes
6
divisors
5
polynomials
5
ramsey theory
5
set theory
5
sidon sets
5
factorials
4
unit fractions
4
binomial coefficients
3
combinatorics
3
complete sequences
3
discrepancy
3
irrationality
3
primitive sets
3
arithmetic progressions
2
hypergraphs
2
turan number
2
base representations
1
cycles
1
group theory
1
iterated functions
1
probability
1
squares
1
Contributing source
source:erdos-problems
23
source:formal-conjectures
4
source:erdos-ai-contributions-wiki
2
source:jayyhk-erdos-lean
2
source:vibemathed
2
source:gpt-erdos
1
source:plby-lean-proofs
1
Problem ledger
2 problems
Graph view
declared open (Lean)
·
formalized
· $500
erdos:146
If
H
H
is bipartite and
r
r
-degenerate, is
e
x
(
n
;
H
)
≪
n
2
−
1
/
r
\mathrm{ex}(n;H) \ll n^{2-1/r}
(a $500 Erdős-Simonovits prize conjecture)? A counterexample refutes the degeneracy conjecture.
graph theory
turan number
N/A
3 sources
declared open (Lean)
·
formalized
erdos:180
For every finite family
F
\mathcal{F}
of graphs, is there a single
G
∈
F
G \in \mathcal{F}
with
e
x
(
n
;
G
)
≪
F
e
x
(
n
;
F
)
\mathrm{ex}(n;G) \ll_{\mathcal{F}} \mathrm{ex}(n;\mathcal{F})
? A counterexample refutes the Erdős-Simonovits compactness conjecture.
graph theory
turan number
N/A
4 sources
Search problems.science
Find a Problem, Result, source, or page