Schmeichel's basis-number conjecture for toroidal graphs
Statement
A graph is toroidal if it can be embedded on the torus, and its basis number is the smallest integer for which has a cycle-space basis in which every edge belongs to at most basis elements. Schmeichel's conjecture. Every toroidal graph has basis number , that is,
This conjecture extends MacLane's characterization of planar graphs, for which the basis number is , to graphs embeddable on the torus. Schmeichel proved the general upper bound for graphs of genus , but the stated toroidal case is not resolved in the supplied 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.