Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Campbell, Rutger, Davies, James, Hickingbotham, Robert
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2507.23182
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Inhaltsangabe:
  • We prove that for every bipartite graph $H$ and positive integer $s$, the class of $K_{s,s}$-subgraph-free graphs excluding $H$ as a pivot-minor has bounded average degree. Our proof relies on the announced binary matroid structure theorem of Geelen, Gerards, and Whittle. Along the way, we also prove that every $K_{s,t}$-free bipartite circle graph with $s\le t$ has a vertex of degree at most $\max\{2s-2, t-1\}$ and provide examples showing that this is tight.