ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graph GG is toroidal if it can be embedded on the torus, and its basis number bn⁡(G)\operatorname{bn}(G) is the smallest integer kk for which GG has a cycle-space basis in which every edge belongs to at most kk basis elements. Schmeichel's conjecture. Every toroidal graph has basis number 33, that is,

bn⁡(G)=3.\operatorname{bn}(G)=3.

This conjecture extends MacLane's characterization of planar graphs, for which the basis number is 22, to graphs embeddable on the torus. Schmeichel proved the general upper bound bn⁡(G)≤2g+2\operatorname{bn}(G)\leq 2g+2 for graphs of genus gg, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.