List Coloring of Two Matroids through Reduction to Partition Matroids
From MaRDI portal
Publication:5157385
DOI10.1137/20M1385615zbMath1491.05044arXiv1911.10485OpenAlexW3200797463MaRDI QIDQ5157385
Tamás Schwarcz, Yutaro Yamaguchi, Kristóf Bérczi
Publication date: 18 October 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.10485
Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)
Related Items
Rainbow and monochromatic circuits and cocircuits in binary matroids ⋮ Choice functions ⋮ Partitioning into common independent sets via relaxing strongly base orderability ⋮ On the impossibility of decomposing binary matroids
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the number of matroids compared to the number of sparse paving matroids
- A note on list arboricity
- The list chromatic index of a bipartite multigraph
- On the asymptotic proportion of connected matroids
- List coloring of matroids and base exchange properties
- Gammoids and transversal matroids
- The matroid intersection cover problem
- Lattice Theory of Generalized Partitions
- The intersection of a matroid and a simplicial complex
- Weak Maps of Combinatorial Geometries
- Disjoint Common Transversals and Exchange Structures
- Properties of rank preserving weak maps
- On the Abstract Properties of Linear Dependence
- A Catalogue of Combinatorial Geometries
- Transversals and matroid partition
- A generalization of Kónig's theorem
- Decomposition of Finite Graphs Into Forests