The diagonal-label characterization of complete Young graphs
Statement
Let a Young graph be the graph associated with the -reverse multiples, whose node labels have the form . A node is nonzero diagonal-labelled when its label is with .
Complete Young graph conjecture. A Young graph is a complete graph if and only if it has at least one nonzero diagonal-labelled node .
This is a stronger statement than the preceding theorem, which proves only that a Young graph is complete when every node label has the form . The conjecture is consistent with all the data reported in the paper, but 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.