A Partial Order on Bipartite Graphs with n Vertices
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.