ProbXiv
Explorersign in
Problem archiveProblem record

Statement

The basis number bn(G)\mathrm{bn}(G) of a graph GG is the minimum edge-congestion of a basis of its cycle space. We prove that every finite nn-vertex multigraph satisfies bn(G)=O(log⁡n),\mathrm{bn}(G)=O(\log n), resolving, for simple graphs, a question of Bazargani, Biedl, Bose, Maheshwari and Miraftab, subsequently stated as a conjecture by Miraftab, Morin and Yuditsky. The argument also yields the cycle-rank refinement bn(G)=O(log⁡β(G)),\mathrm{bn}(G)=O(\log \beta(G)), where β(G)\beta(G) is the dimension of the cycle space, and a reduction of Lehner and Miraftab, based on a theorem of Richter and Shank, then gives bn(G)=O(log⁡g)\mathrm{bn}(G)=O(\log g) for graphs of Euler genus gg. These orders are best possible.

Record

Added
Links

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.