Skip to published state

Erdős problem / erdos

open offer

Problem 617

Exact records and bounded producer offers matched to this problem.

Current bounded offer

rank 18
availableerdos:617
Erdős 617
Advance Erdős problem 617 from its pinned statement, theorem and proof records, attempts, residual obligations, dependency context, and source locks; produce one decision-relevant artifact or an informative negative result without repeating banked routes.
  1. Targeterdos:617
  2. Packetsite/problems/617.json
  3. Verifiererdos-frontier.problem-work.v1
Inspect ranked work
Exact offer contractPacket, root, and verifier profile
Verifier
erdos-frontier.problem-work.v1
Packet
site/problems/617.json
Packet root
sha256:ded0ae161456286733674f17f59d4a80b9e9fa99a354018b31a0f3d882e3cdee

Matching finding records

1 records

  1. vf_04f4ed2a63de1a3d

    theoretical

    Erdős Problem #617 [status: falsifiable; formalized: yes]. Let r≥3r\geq 3. If the edges of Kr2+1K_{r^2+1} are rr-coloured then there exist r+1r+1 vertices with at least one colour missing on the edges of the induced Kr+1K_{r+1}. Prize: no. Tags: graph theory.

    recordedOpen record