Rainbow and monochromatic circuits and cocircuits in binary matroids
From MaRDI portal
Publication:2124622
DOI10.1016/j.disc.2022.112830zbMath1495.05024arXiv2012.05037OpenAlexW4213002492MaRDI QIDQ2124622
Kristóf Bérczi, Tamás Schwarcz
Publication date: 11 April 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.05037
Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs and digraphs with given girth and connectivity
- The list chromatic index of a bipartite multigraph
- On rainbow-cycle-forbidding edge colorings of finite graphs
- On graphs and rigidity of plane skeletal structures
- The matroid intersection cover problem
- The intersection of a matroid and a simplicial complex
- Weak Maps of Combinatorial Geometries
- Some Abstract Pivot Algorithms
- Properties of rank preserving weak maps
- On the Abstract Properties of Linear Dependence
- List Coloring of Two Matroids through Reduction to Partition Matroids
- Rainbow Odd Cycles
- Decomposition of Finite Graphs Into Forests