Density upper-bound conjecture for the truncated square tiling graph
Statement
Let be the infinite truncated square tiling graph, and let denote its optimal broadcast density. Density conjecture. The optimal densities satisfy
These are proposed upper bounds for the unresolved optimal densities in the , , and broadcast settings; the surrounding results establish analogous bounds for other parameter pairs.
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.