A Partial Order on Bipartite Graphs with n Vertices
classification
💻 cs.DM
keywords
orderpartialbipartitegraphsverticescategoryexaminesmorphisms
read the original abstract
The paper examines a partial order on bipartite graphs (X1, X2, E) with n vertices, X1UX2={1,2,...,n}. This partial order is a natural partial order of subobjects of an object in a triangular category with bipartite graphs as morphisms.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.