Szegö's construction conjecture for tight multigraphs
Statement
Let be a -tight multigraph, with . Let denote the graph with two vertices and parallel edges, and let a -dimensional -extension be the graph operation used in the conjecture. Szegö's conjecture. The graph can be constructed from using -dimensional -extensions, with no more than parallel edges created between any pair of vertices. This conjecture strengthens the Frank–Szegö construction theorem by imposing the stated bound on parallel edges for -tight multigraphs in the indicated range of ; 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.