Related papers: Dirac's theorem on chordal graphs and Alexander du…
In this note, we present a simple directed graph proof of Sharkovsky's theorem.
We define the Ricci curvature on simplicial complexes by modifying the definition of the Ricci curvature on graphs, and we prove the upper and lower bounds of the Ricci curvature. These properties are generalizations of previous studies.…
A fundamental question in graph theory is to establish conditions that ensure a graph contains certain spanning subgraphs. Two well-known examples are Tutte's theorem on perfect matchings and Dirac's theorem on Hamilton cycles.…
We prove several results about chordal graphs and weighted chordal graphs by focusing on exposed edges. These are edges that are properly contained in a single maximal complete subgraph. This leads to a characterization of chordal graphs…
Recently we have obtained two simple proofs of Sharkovsky's theorem, one with directed graphs [7] and the other without [8]. In this note, we present yet more simple proofs of Sharkovsky's theorem.
From the method of realization of bialgebras developped in a preceding paper, we obtain the Duality Theorem and apply it to the study of the ideal of relations for each realized bialgebra. This is detailed in the english version of the…
A Lagrangian theory giving rise to a version of the Dirac-Kahler equations on curved backgrounds is considered. The principal pieces are the general fields which have values in the algebra of the Dirac matrices and satisfy a Dirac-type…
We use the famous knot-theoretic consequence of Freedman's disc theorem---knots with trivial Alexander polynomial bound a locally-flat disc in the 4-ball---to prove the following generalization. The degree of the Alexander polynomial of a…
In this note, we present a simple non-directed graph proof of Sharkovsky's theorem which is different from the one given in [2].
We prove some results concerning Alcuin number of graphs. First, we classify graphs which have unique minimum vertex cover. Then we present two necessary conditions for a graph to be of class two and show why one of them (condition on…
We prove Libgober's divisibility relations for Oka and Alexander polynomials of symplectic curves in the complex projective plane. Along the way, we give new proofs of the divisibility relations for the Alexander polynomials of complex…
To any graph and smooth algebraic curve $C$ one may associate a "hypercurve" arrangement and one can study the rational homotopy theory of the complement $X$. In the rational case ($C=\mathbb{C}$), there is considerable literature on the…
Let G be a simple undirected graph on n vertices, and let I(G) \subseteq R = k[x_1,...,x_n] denote its associated edge ideal. We show that all chordal graphs G are sequentially Cohen-Macaulay; our proof depends upon showing that the…
A graph is chordal if every cycle of length at least four has a chord. In 1961, Dirac characterized chordal graphs as those graphs that can be built from complete graphs by repeated clique-sums. Generalizing this, we consider the class of…
In this work we investigate the chordality of squares and line graph squares of graphs. We prove a sufficient condition for the chordality of squares of graphs not containing induced cycles of length at least five. Moreover, we characterize…
Dirac's equation of the electron will be discussed by using quaternions as the basis of a new formalism which seems to be very well adapted to the problem. The transformation properties of the equations as well as the invariant and…
Duality of curves is one of the important aspects of the ``classical'' algebraic geometry. In this paper, using this foundation, the duality of tropical polynomials is constructed to introduce the duality of Non-Archimedean curves. Using…
Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…
We complete the enumeration of the possible roots of the Alexander polynomial (both conventional and over finite fields) of a trigonal curve. The curves are not assumed proper or irreducible.
We generalize chain enumeration in graded partially ordered sets by relaxing the graded, poset and Eulerian requirements. The resulting balanced digraphs, which include the classical Eulerian posets having an $R$-labeling, imply the…