Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Alon-Tarsi number of K3,3K_{3,3}-minor-free graphs

Published 11 Oct 2023 in math.CO | (2310.07445v2)

Abstract: The well known Wagner's theorem states that a graph is a planar graph if and only if it is K5K_5-minor-free and K3,3K_{3,3}-minor-free. Denote by AT(G)AT(G) the Alon-Tarsi number of a graph GG. We show that for any K3,3K_{3,3}-minor-free graph GG, AT(G)≤5AT(G)\le 5, there exists a matching MM and a forest FF such that AT(G−M)≤4AT(G-M)\le 4 and AT(G−E(F))≤3AT(G-E(F))\le 3, extending the result on the Alon-Tarsi number of K5K_5-minor-free graphs due to Abe, Kim and Ozeki.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.