Gishboliner–Jin–Sudakov edge-mapping conjecture
There is an absolute constant such that, for every graph with vertices and edges, , where is the least integer such that every mapping satisfying for every admits a copy of in such that for every .
References
- Sharp Bounds for Edge Mappings of Graphs — arXiv — Zhanping Yang
Source: arXiv
Progress summary
A new unrefereed preprint claims the conjecture is false and identifies a different sharp growth rate, but the result has not been independently checked.
The conjecture predicts an extremal bound of order for the edge-mapping problem. Its proposed replacement is a larger order, , across the claimed general parameter range.
November 2026 claimed refutation
Zhanping Yang's preprint Sharp Bounds for Edge Mappings of Graphs claims to disprove the estimate and establish matching upper and lower bounds of order . The claim changes both the conjecture's truth value and the predicted extremal scale, but is supported only by the unrefereed preprint.
Current status (as of November 2026): The conjectured estimate is claimed false and the order is claimed sharp, but these conclusions remain unverified.
Sources
Solutions 0
No solutions have been posted yet.