Name
Abstract | ||
|---|---|---|
Let and be fixed integers, and let be an -uniform hypergraph with vertices and edges. In 1997, Bollobás and Scott conjectured that has a vertex-partition into sets with at most edges in each set. So far, this conjecture was confirmed when or . In this paper, we show that it holds for for any . |
Year | DOI | Venue |
|---|---|---|
2018 | https://doi.org/10.1007/s10878-017-0153-x | J. Comb. Optim. |
Keywords | Field | DocType |
Hypergraph,Partition,Max-Cut,Azuma–Hoeffding inequality,05C35,05C65 | Integer,Discrete mathematics,Combinatorics,Vertex (geometry),Hypergraph,Constraint graph,Omega,Partition (number theory),Conjecture,Mathematics,Maximum cut | Journal |
Volume | Issue | ISSN |
35 | 1 | 1382-6905 |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shu-Fei Wu | 1 | 9 | 2.92 |
| liu | 2 | 195 | 21.38 |