Related papers: Ehrhart clutters: Regularity and Max-Flow Min-Cut

The distinguishing result of this paper is a $\mathbf{P}$-time enumerable partition of all the potential perfect matchings in a bipartite graph. This partition is a set of equivalence classes induced by the missing edges in the potential…

For a complex parameter $c$ outside the unit disk and an integer $n\ge2$, we examine the $n$-ary collinear fractal $E(c,n)$, defined as the attractor of the iterated function system $\{\mbox{$f_k \colon \mathbb{C} \longrightarrow…

We prove the following two results. \begin{enumerate} \item Let $\mathcal{A}$ be a unital commutative C*-algebra and $\mathcal{A}^d$ be the standard Hilbert C*-module over $\mathcal{A}$. Let $n\geq d$. If $\{\tau_j\}_{j=1}^n$ is any…

Let $K$ be an algebraically closed field of null characteristic and $p(z)$ a Hilbert polynomial. We look for the minimal Castelnuovo-Mumford regularity $m_{p(z)}$ of closed subschemes of projective spaces over $K$ with Hilbert polynomial…

A graph is CIS if every maximal clique interesects every maximal stable set. Currently, no good characterization or recognition algorithm for the CIS graphs is known. We characterize graphs in which every maximal matching saturates all…

In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D \geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…

In this article, we explore the combinatorics of balanced collections. A collection of subsets of the set $[n] = \{1, \dots, n\}$ is called \emph{balanced} if the relative interior of the convex hull of the corresponding characteristic…

Bir\'{o}, Hujter, and Tuza introduced the concept of $H$-graphs (1992), intersection graphs of connected subgraphs of a subdivision of a graph $H$. They naturally generalize many important classes of graphs, e.g., interval graphs and…

We study $M$-alternating Hamilton paths and $M$-alternating Hamilton cycles in a simple connected graph $G$ on $\nu$ vertices with a perfect matching $M$. Let $G$ be a bipartite graph, we prove that if for any two vertices $x$ and $y$ in…

In this article we extend a previous definition of Castelnuovo-Mumford regularity for modules over an algebra graded by a finitely generated abelian group. Our notion of regularity is based on Maclagan and Smith's definition, and is…

In the Minimum Clique Routing Problem on Cycles \textsc{MCRPC} we are given a cycle together with a set of demands (weighted origin-destination pairs) and the goal is to route all the pairs minimizing the maximum weighted clique of the…

A {\it clutter} (or {\it antichain} or {\it Sperner family}) $L$ is a pair $(V,E)$, where $V$ is a finite set and $E$ is a family of subsets of $V$ none of which is a subset of another. Normally, the elements of $V$ are called {\it…

The well-known Erd\H{o}s-Hajnal conjecture states that for any graph $F$, there exists $\epsilon>0$ such that every $n$-vertex graph $G$ that contains no induced copy of $F$ has a homogeneous set of size at least $n^{\epsilon}$. We consider…

We give the Castelnuovo-Mumford regularity of arrangements of (n-2)-planes in P^n whose incidence graph is a sufficiently large complete bipartite graph, and determine when such arrangements are arithmetically Cohen-Macaulay.

A cluster graph is a graph whose every connected component is a complete graph. Given a simple undirected graph $G$, a subset of vertices inducing a cluster graph is called an independent union of cliques (IUC), and the IUC polytope…

In this paper, we mainly study the Castelnuovo-Mumford regularity of the generalized binomial edge ideals of graphs. We show that this number can be any integer number from $2$ to $n-1$ where $n$ is the number of vertices in the underlying…

Let $A$ be a $m\times m$ complex matrix with zero trace. Then there are $m\times m$ matrices $B$ and $C$ such that $A=[B,C]$ and $\|B\|\|C\|_2\le (\log m+O(1))^{1/2}\|A\|_2$ where $\|D\|$ is the norm of $D$ as an operator on $\ell_2^m$ and…

We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows.…

We conjecture that every oriented graph $G$ on $n$ vertices with $\delta ^+ (G) , \delta ^- (G) \geq 5n/12$ contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing…

We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number $k \ge 0$ of hamiltonian cycles, which is especially efficient for small $k$. Our main findings, combining applications of this algorithm…