research
∙
04/26/2023
Reconfiguration of the Union of Arborescences
An arborescence in a digraph is an acyclic arc subset in which every ver...
share
research
∙
02/02/2023
Partitioning into common independent sets via relaxing strongly base orderability
The problem of covering the ground set of two matroids by a minimum numb...
research
∙
11/23/2022
Weighted exchange distance of basis pairs
Two pairs of disjoint bases 𝐏_1=(R_1,B_1) and 𝐏_2=(R_2,B_2) of a matroid...
research
∙
03/03/2022
Exchange distance of basis pairs in split matroids
The basis exchange axiom has been a driving force in the development of ...
research
∙
02/09/2022
Hypergraph characterization of split matroids
We provide a combinatorial study of split matroids, a class that was mot...
research
∙
12/09/2020
Rainbow and monochromatic circuits and cuts in binary matroids
Given a matroid together with a coloring of its ground set, a subset of ...
research
∙
11/24/2019
