Asymptotic unit bar visibility number conjecture for complete bipartite graphs
Statement
Let be the complete bipartite graph with , and let denote the unit bar visibility number of a graph . Asymptotic unit bar visibility conjecture. For ,
This conjecture asserts that the known upper bound for the unit bar visibility number of complete bipartite graphs is asymptotically sharp.
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.