ProbXiv
sign in
Problem archiveProblem record

Statement

Pavez-Signe (2024) conjectured a Dirac-type condition for spanning HH-subdivisions and asked whether the subdivision paths can additionally be required to have similar lengths; Lee (2025) resolved the existence conjecture in the stronger digraph setting. Answered affirmatively with epsilon-room: for every ε>0\varepsilon > 0 there is C0C_0 such that every nn-vertex digraph DD with n≥C0hn \ge C_0 h and minimum semi-degree δ0(D)≥(1/2+ε)n\delta^0(D) \ge (1/2+\varepsilon)n contains a spanning HH-subdivision whose path lengths differ by at most one, for every digraph HH with hh arcs and no isolated vertices.

Record

Comments

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

  1. proof attempt · #1

    Zhilan Wang, Shuo Wei and Jin Yan, using ChatGPT 5.6

    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 assisted
    — a person led the work and used a model along the way.

    The acknowledgement states the authors used ChatGPT 5.6 to assist in the development of the probabilistic partition argument in one named lemma, plus language polishing, with all arguments independently verified by the authors.

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.

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.