相关论文: Full graph and complete Lie algebra

We show that the problem of counting perfect matchings remains #P-complete even if we restrict the input to very dense graphs, proving the conjecture in [5]. Here "dense graphs" refer to bipartite graphs of bipartite independence number…

We offer a new perspective on the closed graph theorem and the open mapping theorem for separated barrelled spaces and fully complete spaces.

Over a field of characteristic zero we prove two formality conditions. We prove that a dg Lie algebra is formal if and only if its universal enveloping algebra is formal. We also prove that a commutative dg algebra is formal as a dg…

Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways. For the first of these, we show that…

We define a perfect coloring of a graph $G$ as a proper coloring of $G$ such that every connected induced subgraph $H$ of $G$ uses exactly $\omega(H)$ many colors where $\omega(H)$ is the clique number of $H$. A graph is perfectly colorable…

Here we prove that Reed Conjecture is valid for {P5, Flag_Complement}-free graphs where FlagComplement is the complement of the Flag graph. Some of the known results follow as corollaries to our result. Reed conjecture is still open in…

We present an algebraic characterization of perfect graphs, i.e., graphs for which the clique number and the chromatic number coincide for every induced subgraph. We show that a graph is perfect if and only if certain nonnegative…

In this work, we prove that partially commutative, partially commutative metabelian, or partially commutative nilpotent Lie algebra splits into the direct sum of two subalgebras if and only if the completion of the defining graph of this…

A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A simplicial complex $\Delta$ is called pure if all of its facets have the same cardinality. Let $\mathcal G$ be the class of graphs…

If one wishes to define a complete Leibniz algebra in such a way as to extend the notion of a complete Lie algebra, two distinct definitions can be found in the current literature. Since biderivations on complete Lie algebras have already…

In this paper, we generalize the notions of perfect matchings, perfect 2-matchings to perfect k-matchings and give a necessary and sufficient condition for existence of perfect k-matchings. For bipartite graphs, we show that this k-matching…

We determine the solvable complete Lie algebras whose nilradical is isomorphic to a filiform Lie algebra. Moreover we show that for any positive integer $n$ there exists a solvable complete Lie algebras whose second cohomology group with…

After a short review of the classical Lie theorem, a finite dimensional Lie algebra of vector fields is considered and the most general conditions under which the integral curves of one of the fields can be obtained by quadratures in a…

We find all polyhedral graphs such that their complements are still polyhedral. These turn out to be all self-complementary.

A graph is called t-perfect if its stable set polytope is defined by non-negativity, edge and odd-cycle inequalities. We show that it can be decided in polynomial time whether a given claw-free graph is t-perfect.

A graph is {\em perfect} if, in all its induced subgraphs, the size of a largest clique is equal to the chromatic number. Examples of perfect graphs include bipartite graphs, line graphs of bipartite graphs and the complements of such…

A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that minimal matching covered graphs contain a perfect matching.

In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…

We characterize those graphs which correspond to a rigid 2-step nilpotent Lie algebra in the variety of at most 2-step nilpotent Lie algebras.

We prove that the Lie commutator subalgebra of the associative algebra containing a matrix subalgebra is perfect.