On a specific problem of partition of graph
Combinatorics
2023-08-16 v1
Abstract
In this short article, we consider a problem about -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 has a nice lower bound.
Cite
@article{arxiv.2308.07349,
title = {On a specific problem of partition of graph},
author = {Peisheng Yu},
journal= {arXiv preprint arXiv:2308.07349},
year = {2023}
}