Vela
✦ 5 frontiers

erdős #573

← #572 · #574 → (packet.json; erdosproblems.com)

Is it true that

Worked, still open.

graph theory · open · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

evidence

unverified AI candidates (2)

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

It’s **not known**. The statement [ \mathrm{ex}(n;{C_3,C_4})\sim\left(\frac n2\right)^{3/2} ] is essentially **Erdős’s conjecture** and remains **wide open**.

candidate solution ↗

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.

candidate solution ↗

oeis

A006856 — Maximal number of edges in n-node graph of girth at least 5.0,1,2,3,5,6,8,10,12,15,16,18,21,23,26,28,31,34,38,41,44,47,50,54,57,61,65,68,72,76,80,85,87,90,95,99,104,109,114,120,124

#48 in Extremal Graph Theory · link

Create a formalisation here · link

status

open

notary

vela reproduce examples/erdos-problems
  • packet.json · sha256 0422286faad551e1eda3e191d6383f1150b68510a0389b07da05bca27fd8e771

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.