erdős #585
What is the maximum number of edges that a graph on vertices can have if it does not contain two edge-disjoint cycles with the same vertex set?
Worked, still open.
graph theory · open · possible · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
Let $f(n)$ be the maximum number of edges in an $n$-vertex (simple) graph that **does not** contain two **edge-disjoint** cycles with the **same vertex set**.
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗links
Create a formalisation here · link
status
open