Siwei Lin

activity

20232026

collaborators

5 papers

math.CO2026

On several judicious partitioning problems of graphs and hypergraphs

Siwei Lin, Qinghou Zeng

Judicious partition problems ask for vertex partitions of graphs or hypergraphs that optimize several quantities simultaneously. In this paper, we investigate judicious partitions…

math.CO2026

Internal partitions of $5$ -regular and $8$ -regular graphs

Siwei Lin, Qinghou Zeng

An \emph{internal partition} of a graph is a partition of its vertex set into two nonempty parts such that every vertex has at least half of its neighbors in its own part. DeVos as…

math.CO2026

The $O (m^{2/3})$ error term for judicious partitions of 3-uniform hypergraphs

Siwei Lin, Qinghou Zeng

Let $k \geq 2$ be a fixed integer. Bollobás and Scott proved that every $3$ -uniform hypergraph with $m$ edges admits a partition of its vertex set into $k$ parts such that each part s…

math.CO2025

Max-Bisections of graphs without even cycles

Jianfeng Hou, Siwei Lin, Qinghou Zeng

For an integer $k \geq 2$ , let $G$ be a graph with $m$ edges and without cycles of length $2 k$ . The pivotal Alon-Krivelevich-Sudakov Theorem on Max-Cuts states that $G$ has a biparti…

math.CO2023

MaxCut in graphs with sparse neighborhoods

Jinghua Deng, Jianfeng Hou, Siwei Lin +1

Let $G$ be a graph with $m$ edges and let $mc (G)$ denote the size of a largest cut of $G$ . The difference $mc (G) - m /2$ is called the surplus $sp (G)$ of $G…

On several judicious partitioning problems of graphs and hypergraphs

Internal partitions of 5-regular and 8-regular graphs

The O(m2/3) error term for judicious partitions of 3-uniform hypergraphs

Max-Bisections of graphs without even cycles

MaxCut in graphs with sparse neighborhoods

Internal partitions of $5$ -regular and $8$ -regular graphs

The $O (m^{2/3})$ error term for judicious partitions of 3-uniform hypergraphs