Erdős problem 128
Let G be a graph with n vertices such that every induced subgraph on ≥ vertices has more than edges. Must G contain a triangle?
- Formal statements
- 1 open
- Erdős Problems says
- falsifiable
- Decision here
- No current contribution
- Checks
- 0 checks · 1 formal
Current Result
Current Result
No result has been accepted here yet.
- Type
- —
- Evidence
- 0 artifacts
- Decision
- None
- Reviewed
- No date retained