Skip to content

Problems · Vela Mathematics Program

Narrowed toturan number ×Clear all

Problem ledger

23 problemsGraph view
declared disprovederdos:59
Erdős problem 59
graph theoryturan numberN/A
declared disproved · $500erdos:113
Erdős problem 113
graph theoryturan numberN/A
declared open (Lean) · formalized · $500erdos:146
If HH is bipartite and rr-degenerate, is ex(n;H)≪n2−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 theoryturan numberN/A3 sources
declared disproved · $500erdos:147
Erdős problem 147
graph theoryturan numberN/A
declared open (Lean) · formalizederdos:180
For every finite family F\mathcal{F} of graphs, is there a single G∈FG \in \mathcal{F} with ex(n;G)≪Fex(n;F)\mathrm{ex}(n;G) \ll_{\mathcal{F}} \mathrm{ex}(n;\mathcal{F})? A counterexample refutes the Erdős-Simonovits compactness conjecture.
graph theoryturan numberN/A4 sources
declared open · $500erdos:500
Erdős problem 500
graph theoryhypergraphsturan numberA140462
declared openerdos:571
Erdős problem 571
graph theoryturan numberN/A
declared openerdos:572
Erdős problem 572
graph theoryturan numberpossible
declared openerdos:573
Erdős problem 573
graph theoryturan numberA006856
declared disprovederdos:574
Erdős problem 574
graph theoryturan numberpossible
declared openerdos:575
Erdős problem 575
graph theoryturan numberN/A
declared openerdos:576
Erdős problem 576
graph theoryturan numberpossible
declared open · formalizederdos:579
True ↔ ∀ (δ : ℝ), 0 < δ → ∃ c, 0 < c ∧ ∀ᶠ (n : ℕ) in Filter.atTop, ∀ (G : SimpleGraph (Fin n)), Erdos579.octahedron.Free G → δ * ↑n ^ 2 ≤ ↑G.edgeFinset.card → c * ↑n ≤ ↑G.indepNum
graph theoryturan numberN/A2 sources
declared open · $500erdos:712
Erdős problem 712
graph theoryturan numberhypergraphspossible
declared open · $500erdos:713
Erdős problem 713
graph theoryturan numberN/A
declared openerdos:714
Erdős problem 714
graph theoryturan numberpossible
declared solved (Lean)erdos:765
Erdős problem 765
graph theoryturan numberA0068553 sources
declared openerdos:766
Erdős problem 766
graph theoryturan numberpossible
declared provederdos:767
Erdős problem 767
graph theoryturan numberpossible
declared disproved (Lean) · formalizederdos:794
False ↔ ∀ (n : ℕ) (H : Finset (Finset (Fin (3 * n)))), H.IsThreeUniform → n ^ 3 + 1 ≤ H.card → H.ContainsSubgraph 4 3 ∨ H.ContainsSubgraph 5 7
graph theoryhypergraphsturan numberN/A5 sources
declared solvederdos:1079
Erdős problem 1079
graph theoryturan numberN/A
declared openerdos:1157
Erdős problem 1157
hypergraphsturan numberpossible
declared openerdos:1158
Erdős problem 1158
hypergraphsturan numberpossible

Search problems.science

Find a Problem, Result, source, or page