Vela

Let be a graph on at most vertices which contains no and no (the complete bipartite graph with vertices in each class). Is it true thatWhat about finite ?

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

Let me first unpack the notation the way it is usually meant in this part of partition calculus.

candidate solution ↗

llm-hunter · gpt pro 5.2 · unverified

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

candidate solution ↗

status

open

notary

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

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.