Crew's generalized degree sequence conjecture for trees
Statement
Let be a tree. For a vertex subset , write and let be the number of edges of with exactly one endpoint in . The generalized degree sequence of is the multiset
Crew's conjecture. For any tree , the generalized degree sequence of is determined by .
This extends the fact that restricting to singleton subsets recovers the ordinary degree sequence. The source presents it as an interesting problem posed by Crew; its resolution is not indicated, so it remains open.
Record
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.