Skip to content

Erdős problem 584

Must every graph with nn vertices and δn2\delta n^2 edges contain large subgraphs in which every two edges lie on specified short cycles? A dense high-girth construction refutes the statement when δ\delta may shrink with nn.

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#584
  2. ResultNone
  3. Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

  • construction

    VibeMathed

    Machine
    GPT-5.6 Star Fleet (Claude Fable 5 referee)
    Reported outcome
    variant
    Open the source record

Search problems.science

Find a Problem, Result, source, or page