Vela

Is it true that, for every , there is a constant such thatwhere is the bipartite graph between and , with each joined to a unique pair of ?

Worked, still open.

graph theory · solved · 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

Your (G_k) is exactly the **1‑subdivision of (K_k)**: the (y_i)’s are the original vertices of (K_k), and each (z_{ij}) is the new subdivision vertex inserted on the edge (y_i y_j). In particular, (G_k) is bipartite, every $z$-vertex has degree $2$, and it is (C_4)-free [[nomath]](a $4$-cycle would require two distinct…

candidate solution ↗

llm-hunter · gpt pro 5.2 · unverified

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

candidate solution ↗

status

solved

notary

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

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.