On a specific problem of partition of graph
Abstract
In this short article, we consider a problem about 2-partition of the vertices of a graph. If a graph admits such a partition into some 'small' graphs, then the number of edges cross an arbitrary cut of the graph e(S,Sc) has a nice lower bound.
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.