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.
Context
A 2024 question in the Dirac-type spanning-structures literature, answered in approximate form two years later. Real but young and specialist.
People
Attempts
No person has examined this. 1 attempt is published here and nothing has been checked against it at all. Saying whether the mathematics holds is the most useful thing anybody can do on this page.
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.
Reviews
No person has reviewed this attempt. It has not been checked at all.
Discussion of this attempt
no comments
Solve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.
Discussion
Nothing has been said about this problem yet.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.