On a specific problem of partition of graph

Autor:	Yu, Peisheng
Rok vydání:	2023
Předmět:	Mathematics - Combinatorics
Druh dokumentu:	Working Paper
Popis:	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,S^{c})$ has a nice lower bound.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2308.07349 Zobrazit plný text záznamu View this record from Arxiv