Related papers: Complementation, Local Complementation, and Switch…
Subgraph complementation is an operation that toggles all adjacencies inside a selected vertex set. Given a graph \(G\) and a target class \(\mathcal{C}\), the Minimum Subgraph Complementation problem asks for a minimum-size vertex set…
The way circuits, relative to a basis, are affected as a result of exchanging a basis element, is studied. As consequences, it is shown that three consecutive symmetric exchanges exist for any two bases of a matroid, and that a full serial…
A dominating set $S$ in a graph $G$ is said to be perfect if every vertex of $G$ not in $S$ is adjacent to just one vertex of $S$. Given a vertex subset $S'$ of a side $P_m$ of an $m\times n$ grid graph $G$, the perfect dominating sets $S$…
Zaslavsky introduced the concept of lifted-graphic matroid. For binary matroids, a binary elementary lift can be defined in terms of the splitting operation. In this paper, we give a method to get a forbidden-minor characterization for the…
In recent years, combinatorial reconfiguration problems have attracted great attention due to their connection to various topics such as optimization, counting, enumeration, or sampling. One of the most intriguing open questions concerns…
We characterize a rich class of valuated matroids, called R-minor valuated matroids that includes the indicator functions of matroids, and is closed under operations such as taking minors, duality, and induction by network. We exhibit a…
We study the perfect matching lattice of a matching covered graph $G$, generated by the incidence vectors of its perfect matchings. Building on results of Lov\'asz and de Carvalho, Lucchesi, and Murty, we give a polynomial-time algorithm…
A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that the problem of generating planar tanglegrams uniformly at…
A partial complement of the graph $G$ is a graph obtained from $G$ by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph $G$ and graph class $\mathcal{G}$, is there a…
We study the perfect matching reconfiguration problem: Given two perfect matchings of a graph, is there a sequence of flip operations that transforms one into the other? Here, a flip operation exchanges the edges in an alternating cycle of…
Seymour's decomposition theorem for regular matroids is a fundamental result with a number of combinatorial and algorithmic applications. In this work we demonstrate how this theorem can be used in the design of parameterized algorithms on…
Given a 4-regular graph $F$, we introduce a binary matroid $M_{\tau}(F)$ on the set of transitions of $F$. Parametrized versions of the Tutte polynomial of $M_{\tau}(F)$ yield several well-known graph and knot polynomials, including the…
We provide a constructive characterisation of circuits in the simple (2,2)-sparsity matroid. A circuit is a simple graph G=(V,E) with |E|=2|V|-1 and the number of edges induced by any $X \subsetneq V$ is at most 2|X|-2. Insisting on…
In this paper we introduce a new operation for Linear Programming (LP), called LP complementation, which resembles many properties of LP duality. Given a maximisation (resp.~minimisation) LP $P$, we define its complement $Q$ as a specific…
This paper continues the study of combinatorial properties of binary functions --- that is, functions $f:2^E\rightarrow\mathbb{C}$ such that $f(\emptyset)=1$, where $E$ is a finite set. Binary functions have previously been shown to admit…
The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over…
Simultaneous Geometric Embedding (SGE) asks whether, for a given collection of graphs on the same vertex set V, there is an embedding of V in the plane that admits a crossing-free drawing with straightline edges for each of the given…
Adding elements to matroids can be fraught with difficulty. In the V\'amos matroid $V_8$, there are four independent sets $X_1,X_2, X_3,$ and $X_4$ such that $(X_1 \cup X_2,X_3 \cup X_4)$ is a $3$-separation while exactly three of the local…
Graph modification problems are computational tasks where the goal is to change an input graph $G$ using operations from a fixed set, in order to make the resulting graph satisfy a target property, which usually entails membership to a…
Given any finite subset $A$ of order $n$ of a distributive lattice and $k\in\{1,...,n\}$, there is a natural extension of the median operation to $n$ variables which generalizes the notion of the $k$th smallest element of $A$. By applying…