Some Mader-perfect graph classes
Hui Lei, Siyan Li, Xiaopan Lian, Susu Wang

TL;DR
None
Contribution
None
Abstract
The dichromatic number of , denoted by , is the smallest integer such that admits an acyclic -coloring. We use to denote the smallest integer such that if , then contains a subdivision of . A digraph is called Mader-perfect if for every subdigraph of , . We extend octi digraphs to a larger class of digraphs and prove that it is Mader-perfect, which generalizes a result of Gishboliner, Steiner and Szab\'{o} [Dichromatic number and forced subdivisions, {\it J. Comb. Theory, Ser. B} {\bf 153} (2022) 1--30]. We also show that if is a proper subdigraph of except for the digraph obtained from by deleting an arbitrary arc, then is Mader-perfect.
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
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · graph theory and CDMA systems
