相关论文: Full support of the Kasteleyn operator associated …

We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matchings problems which given a graph $G$ and an integer $k$, ask whether $G$ has two (maximum/perfect) matchings whose symmetric difference is at least $k$. Diverse Pair of…

A matching is said to be disconnected if the saturated vertices induce a disconnected subgraph and induced if the saturated vertices induce a 1-regular graph. The disconnected and induced matching numbers are defined as the maximum…

We propose an Euler transformation that transforms a given $d$-dimensional cell complex $K$ for $d=2,3$ into a new $d$-complex $\hat{K}$ in which every vertex is part of a uniform even number of edges. Hence every vertex in the graph…

We introduce a theory of geometry for nonnoetherian commutative algebras with finite Krull dimension. In particular, we establish new notions of normalization and height: depiction (a special noetherian overring) and geometric codimension.…

Let $P=B\cup R$ be a set of $2n$ points in general position, where $B$ is a set of $n$ blue points and $R$ a set of $n$ red points. A \emph{$BR$-matching} is a plane geometric perfect matching on $P$ such that each edge has one red endpoint…

On finite metric graphs the set of all realizations of the Laplace operator in the edgewise defined $L^2$-spaces are studied. These are defined by coupling boundary conditions at the vertices most of which define non-self-adjoint operators.…

A generic degenerate Lagrangian system of even and odd variables on an arbitrary smooth manifold is examined in terms of the Grassmann-graded variational bicomplex. Its Euler-Lagrange operator obeys Noether identities which need not be…

Given an undirected graph, are there $k$ matchings whose union covers all of its nodes, that is, a matching-$k$-cover? A first, easy polynomial solution from matroid union is possible, as already observed by Wang, Song and Yuan…

Let $n\ge 34$ be an even integer, and $D_n=2\lceil n/4 \rceil-1$. In this paper, we prove that every $\{D_n,\,D_n+1\}$-graph of order $n$ contains $\lceil n/4 \rceil$ disjoint perfect matchings. This result is sharp in the sense that (i)…

The thagomizer matroid, realized as the graphic matroid of the complete tripartite graph $K_{1,1,n}$, has full automorphism group isomorphic to the hyperoctahedral group whenever $n \ge 2$. In the equivariant setting for this action, we…

We study propagation algorithms for the conjunction of two AllDifferent constraints. Solutions of an AllDifferent constraint can be seen as perfect matchings on the variable/value bipartite graph. Therefore, we investigate the problem of…

A simple generalization of the Hall's condition in bipartite graphs, the Normalized Matching Property (NMP) in a graph $G(X,Y,E)$ with vertex partition $(X,Y)$ states that for any subset $S\subseteq X$, we have…

The polynomial relationship between elementary symmetric functions (Cauchy enumeration formula) is formulated via a ``raising operator" and Fock space construction. A simple graphical proof of this relation is proposed. The new operator…

Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation is a full triangulation of some subset P' of P containing all extreme points in…

The fourth listed author and Hans Parshall (\cite{IosevichParshall}) proved that if $E \subset {\mathbb F}_q^d$, $d \ge 2$, and $G$ is a connected graph on $k+1$ vertices such that the largest degree of any vertex is $m$, then if $|E| \ge C…

Given an input graph and weights on its vertices, the maximum co-2-plex problem is to find a subset of vertices maximizing the sum of their weights and inducing a graph of degree at most 1. In this article, we analyze polyhedral aspects of…

The cut polytope of a graph arises in many fields. Although much is known about facets of the cut polytope of the complete graph, very little is known for general graphs. The study of Bell inequalities in quantum information science…

A number which is either the square of an integer or two times the square of an integer is called squarish. There are two main results in the literature on graphs whose number of perfect matchings is squarish: one due to Jockusch (for…

In this work, we stress the existence of isomorphisms which map complex contours from the upper half to contours in the lower half of the complex plane. The metric operator is found to depend on the chosen contour but the maps connecting…

We consider problems of finding a maximum size/weight $t$-matching without forbidden subgraphs in an undirected graph $G$ with the maximum degree bounded by $t+1$, where $t$ is an integer greater than $2$. Depending on the variant forbidden…