Irreducible vertices in definite tree lattices

At least 36 years old · documented by 1989

Let $T$ be a positive-definite weighted tree with exactly one vertex $v$ satisfying $w(v)<d(v)$ . Must $T$ contain a vertex that is irreducible in its lattice $L(T)$ ?

References

Primary source

Open Math Problems Claimed to Be Solved with AI

geometry-topology

Posted 2 months ago

Progress summary

Refreshed 1 month ago

Open

No public discussion or published progress on this problem was found.

No public discussion or published progress was found.

Current status (as of December 2025): the problem appears open, with no recorded activity.

No solutions have been posted yet.