Special case of Rota's basis conjecture on graphic matroids
DOI10.37236/10835zbMath1498.05225OpenAlexW4296995476WikidataQ123161257 ScholiaQ123161257MaRDI QIDQ2088711
Akiko Yazawa, Shun-ichi Maezawa
Publication date: 6 October 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.37236/10835
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Edge-disjoint rainbow spanning trees in complete graphs
- Colorings and orientations of graphs
- On the relations of various conjectures on Latin squares and straightening coefficients
- On Rota's problem about \(n\) bases in a rank \(n\) matroid
- On the number of even and odd Latin squares of order \(p+1\)
- Decompositions into isomorphic rainbow spanning trees
- Improved bounds for Rota's basis conjecture
- On Rota's Basis Conjecture
- The Conjectures of Alon–Tarsi and Rota in Dimension Prime Minus One
- Rota’s Basis Conjecture for Paving Matroids
- Halfway to Rota’s Basis Conjecture
- Multicolored trees in complete graphs
- Multicolored trees in complete graphs
This page was built for publication: Special case of Rota's basis conjecture on graphic matroids
