ProbXiv
sign in
Problem archiveProblem record

Tight Bound for Online Vertex Cover under Edge Arrivals

Algorithms & optimization · solved

1 comment

Statement

What is the optimal competitive ratio for online vertex cover when edges arrive one at a time? The paper proves a tight factor-2 lower bound via a reduction in the blueprint framework of Assadi, Jiang and Xiang, closing the gap left by prior work.

Record

Source
Added

Comments

No person has examined this. Nothing here has been checked at all. say whether it holds →

  1. proof attempt · #1

    Zhihao Gavin Tang, using GPT-5.6 Sol

    That credit came with the record as it was imported. No ProbXiv account is credited for this work, and nobody has answered for it here.

    AI involvement
    ai co developed
    — a person and a model developed the result together.

    The authors had partial progress and suggested the Assadi-Jiang-Xiang blueprint might apply; "prompted by this suggestion, OpenAI's GPT-5.6 Sol formulated the reduction yielding the tight factor-2 lower bound proved in this paper and assisted with drafting the manuscript." The authors independently verified the reduction, proof and citations.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

open in Claude →open in ChatGPT →

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.