The graded-graph path-count conjecture
Statement
Let be a graded graph of height , and let be the number of oriented paths that pass through every level of . Let be independent, identically distributed random variables with common law , and let . Write for the probability that the labels along a path in produce a vector in .
Graded-graph path-count conjecture. One has
This conjecture extends the corresponding inequality for trees to arbitrary graded graphs. It asserts that the number of complete oriented paths alone gives the same lower bound for the probability that no path produces a vector in ; its resolution is not specified in the source.
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.