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
cycles ×
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
22
source:formal-conjectures
6
source:erdos-ai-contributions-wiki
1
source:jayyhk-erdos-lean
1
source:vibemathed
1
Problem ledger
1 problem
Graph view
declared open
erdos:584
Must every graph with
n
n
vertices and
δ
n
2
\delta n^2
edges contain large subgraphs in which every two edges lie on specified short cycles? A dense high-girth construction refutes the statement when
δ
\delta
may shrink with
n
n
.
graph theory
cycles
N/A
2 sources
Search problems.science
Find a Problem, Result, source, or page