相关论文: Dirac's theorem on chordal graphs and Alexander du…

We present an algorithm for determining whether a bipartite graph $G$ is 2-chordal (formerly doubly chordal bipartite). At its core this algorithm is an extension of the existing efficient algorithm for determining whether a graph is…

We introduce a notion of quadratic duality for chiral algebras. This can be viewed as a chiral version of the usual quadratic duality for quadratic associative algebras. We study the relationship between this duality notion and the…

Let G be a finite simple graph. From the pioneering work of R. P. Stanley it is known that the cycle matroid of G is supersolvable iff G is chordal (rigid): this is another way to read Dirac's theorem on chordal graphs. Chordal binary…

In this paper, we establish the relation between classic invariants of graphs and their integer Laplacian eigenvalues, focusing on a subclass of chordal graphs, the strictly chordal graphs, and pointing out how their computation can be…

Refining a basic result of Alexander, we show that two flag simplicial complexes are piecewise linearly homeomorphic if and only if they can be connected by a sequence of flag complexes, each obtained from the previous one by either an edge…

In this paper, we study the notion of chordality and cycles in hypergraphs from a commutative algebraic point of view. The corresponding concept of chordality in commutative algebra is having a linear resolution. However, there is no…

We introduce the notion of doubling and r-tupling for simplicial complexes, a notion reminiscent to that of matching complexes in graph theory. We prove a connectivity result for such complexes and relate r-tupling to stabilizing r times…

In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…

We provide an optimal sufficient condition, relating minimum degree and bandwidth, for a graph to contain a spanning subdivision of the complete bipartite graph $K_{2,\ell}$. This includes the containment of Hamilton paths and cycles, and…

An alternative proof of bornological Verdier duality for complex manifolds, as proven initially by Prosmans & Schneiders is given, using Schneider's theory of quasi-abelian homological algebra, and the theory of residues and duality.

We show that Bloch's complex of relative zero-cycles can be used as a dualizing complex over perfect fields and number rings. This leads to duality theorems for torsion sheaves on arbitrary separated schemes of finite type over…

We present a novel method of associating Euclidean features to simplicial complexes, providing a way to use them as input to statistical and machine learning tools. This method extends the node2vec algorithm to simplices of higher…

We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…

In this note we discuss dual pairs in Dirac geometry. We show that this notion appears naturally when studying the problem of pushing forward a Dirac structure along a surjective submersion, and we prove a Dirac-theoretic version of…

We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]

It is shown that Euler's theorem for graphs can be generalized for 2-complexes. Two notions that generalize cycle and Eulerian tour are introduced (``circlet'' and ``Eulerian cover''), and we show that for a strongly-connected, pure…

We study the geometric change of Chow cohomology classes in projective toric varieties under the Weil-McMullen dual of the intersection product with a Lefschetz element. Based on this, we introduce toric chordality, a generalization of…

The dual normal factor graph and the factor graph duality theorem have been considered for discrete graphical models. In this paper, we show an application of the factor graph duality theorem to continuous graphical models. Specifically, we…

Let $G$ be a 2-connected graph of order $n$ and let $c$ be the circumference - the order of a longest cycle in $G$. In this paper we present a sharp lower bound for the circumference based on minimum degree $\delta$ and $p$ - the order of a…

Simple and shorter proofs of two Dirac-type theorems involving connectivity are presented.