← All problems

Clay–Jordán forest conjecture

This entry tracks Clay–Jordán forest conjecture.

It claims a broad resolution of a removable-subgraph conjecture for forests.

Latest development

The paper proves the stated forest-removal threshold for all k and treats edge connectivity in parallel.

Editorial caveat

The claim is supported only by the primary preprint.

References

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.