We prove that a graph does not contain as a minor a graph formed by 0-, 1-, 2- or 3-summing k copies of K₅ or K3,3, if and only if it has bounded genus.
No takes yet. Share an insight, caveat, or question.
Robertson et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: