A 32-leaf tree requiring six coordinates for an isometric ℓ_∞ embedding
Statement
Every tree metric with leaves embeds isometrically into , and the least dimension needed is at least . Fitzpatrick and Nowakowski asked in 2000 whether the logarithmic bound is always attained, and Brigham, Chartrand, Dutton and Zhang conjectured in 2005 that every tree with leaves embeds isometrically into , verifying it through . Aksoy, Kilic and Kocak posed a sharp leaf-threshold version for weighted metric trees in 2020.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
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.