相关论文: Integral bases, perfect matchings, and the Peterse…

In this paper we provide a short new proof for the integrality of Rothblum's linear description of the convex hull of incidence vectors of stable matchings in bipartite graphs. In the spirit of iterative rounding proofs, the key feature of…

The Boolean ring $B$ of measurable subsets of the unit interval, modulo sets of measure zero, has proper radical ideals (e.g., $\{0\})$ that are closed under the natural metric, but has no prime ideals closed under that metric; hence closed…

${ NP}$-complete problem "Hamiltonian cycle"\ for graph $G=(V,E)$ is extended to the "Hamiltonian Complement of the Graph"\ problem of finding the minimal cardinality set $H$ containing additional edges so that graph $G=(V,E\cup H)$ is…

If $G$ is a bridgeless cubic graph, Fulkerson conjectured that we can find 6 perfect matchings $M_1,...,M_6$ of $G$ with the property that every edge of $G$ is contained in exactly two of them and Berge conjectured that its edge set can be…

Interaction between clique number $\omega(G) $ and chromatic number $\chi(G) $ of a graph is a well studied topic in graph theory. Perfect Graph Theorems are probably the most important results in this direction. Graph $G$ is called…

An induced matching $M$ in a graph $G$ is dominating if every edge not in $M$ shares exactly one vertex with an edge in $M$. The dominating induced matching problem (also known as efficient edge domination) asks whether a graph $G$ contains…

In this paper, we focus on the study of immanantal polynomials for linear combination matrices composed of the degree matrix and adjacency matrix of a graph. First, applying the concept of vertex orientation for general graphs, we provide a…

This work is about graphs arising from Reuleaux polyhedra. Such graphs must necessarily be planar, $3$-connected and strongly self-dual. We study the question of when these conditions are sufficient. If $G$ is any such a graph with…

In this paper, our goal is to characterize two graph classes based on the properties of minimal vertex (edge) separators. We first present a structural characterization of graphs in which every minimal vertex separator is a stable set. We…

We prove that for every complex classical group $G$ the string polytope associated to a special reduced decomposition and any dominant integral weight $\lambda$ will be a lattice polytope if and only if the highest weight representation of…

We study the module $C^r(\mathcal{P})$ of piecewise polynomial functions of smoothness $r$ on a pure $n$-dimensional polytopal complex $\mathcal{P}\subset\mathbb{R}^n$, via an analysis of certain subcomplexes $\mathcal{P}_W$ obtained from…

We prove that for each positive integer $N$ the set of smooth, zero degree maps $\psi\colon\mathbb{S}^2\to \mathbb{S}^2$ which have the following three properties: (1) there is a unique minimizing harmonic map $u\colon \mathbb{B}^3\to…

A graph $G$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval $I$, such that each leaf of the tree is a vertex of the graph, and there is an edge $\{ x, y \}$ in $G$ if and only if the weight of…

A Banaschewski function on a bounded lattice L is an antitone self-map of L that picks a complement for each element of L. We prove a set of results that include the following: (1) Every countable complemented modular lattice has a…

{\it .}We completely characterize pairs of lattice points $P_1\neq P_2$ in the plane with the property that there are infinitely many lattice points $Q$ whose distance from both $P_1$ and $P_2$ is integral. In particular we show that it…

The Fine interior $F(P)$ of a $d$-dimensional lattice polytope $P \subset {\Bbb R}^d$ is the set of all points $y \in P$ having integral distance at least $1$ to any integral supporting hyperplane of $P$. We call a lattice polytope…

In this paper, we examine covering graphs that are obtained from the $d$-dimensional integer lattice by adding pendant edges. In the case of $d=1$, we show that the Laplacian on the graph has a spectral gap and establish a necessary and…

Covering-based rough set theory is a useful tool to deal with inexact, uncertain or vague knowledge in information systems. Geometric lattice has widely used in diverse fields, especially search algorithm design which plays important role…

A recent paper \cite{CaeCaeSchBar06} proposed a provably optimal, polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal graphical model. Their fundamental result…

The enhanced power graph $\mathcal{P}_E(G)$ of a finite group $G$ is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x, y$ are adjacent if $x, y \in \langle z \rangle$ for some $z \in G$. In this article, we…