For connected layer families on d-element multisets from n symbols, conjecture that f-tilde(d,n)=d(n-1); in particular, can this be proved or refuted for d=3, and for layer…
Statement
For connected layer families on d-element multisets from n symbols, conjecture that f-tilde(d,n)=d(n-1); in particular, can this be proved or refuted for d=3, and for layer families arising from triangulated surfaces are the upper bounds 2n with boundary and n without boundary tight?
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.