Pavez-Signe's Length-Control Question for Spanning Subdivisions
Statement
Pavez-Signe (2024) conjectured a Dirac-type condition for spanning -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 there is such that every -vertex digraph with and minimum semi-degree contains a spanning -subdivision whose path lengths differ by at most one, for every digraph with arcs and no isolated vertices.
Record
Comments
No person has examined this. Nothing here has been checked at all. say whether it holds →
proof attempt · #1
Zhilan Wang, Shuo Wei and Jin Yan, using ChatGPT 5.6That credit came with the record as it was imported. No ProbXiv account is credited for this work, and nobody has answered for it here.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.