The degeneracy and Alon-Tarsi number under $F$-sum operations
Zhiguo Li, Zhentao Jiao, Zeling Shao

TL;DR
This paper characterizes graphs with Alon-Tarsi number 2 and explores how the Alon-Tarsi number behaves under $F$-sum operations, relating it to graph degeneracy.
Contribution
It provides a characterization of graphs with Alon-Tarsi number 2 and analyzes the Alon-Tarsi number in the context of $F$-sum operations based on degeneracy.
Findings
Characterization of graphs with AT(G)=2
Analysis of Alon-Tarsi number under $F$-sum operations
Relationship between Alon-Tarsi number and graph degeneracy
Abstract
The Alon-Tarsi number of a graph is the smallest such that there exists an orientation of with maximum outdegree satisfying that the number of even Eulerian subgraphs is different from the number of odd Eulerian subgraphs. The degeneracy of a graph is the maximum value of the minimum degree over all subgraphs of . In this paper, we obtain a characterization of graphs with for any graph , and study the Alon-Tarsi number of -sum in terms of degeneracy.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Graph theory and applications
