Advanced Search

Let $G$ be a weighted hypergraph with edges of size at most 2. Bollobás and Scott conjectured that $G$ admits a bipartition such that each vertex class meets edges of total weight at least $(w_1-{\Delta }_1)/2+2w_2/3$, where $w_i$ is the total weight of edges of size $i$ and ${\Delta }_1$ is the maximum weight of an edge of size 1. In this paper, for positive integer weighted hypergraph $G$ (i.e., multi-hypergraph), we show that there exists a bipartition of $G$ such that each vertex class meets edges of total weight at least $(w_0-1)/6+(w_1-{\Delta }_1)/3+2w_2/3$, where $w_0$ is the number...