The following pages link to On partitioning of hypergraphs (Q879389):
Displaying 13 items.
- Partitions of large Rado graphs (Q834717) (← links)
- A note on formulations for the \(A\)-partition problem on hypergraphs (Q1276964) (← links)
- On an equivalence in discrete extremal problems (Q1301649) (← links)
- The partition of a uniform hypergraph into pairs of dependent hyperedges (Q1356565) (← links)
- General edge-isoperimetric inequalities. II: A local-global principle for lexicographical solutions (Q1362991) (← links)
- (Q3002403) (← links)
- (Q3104260) (← links)
- Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles (Q3548725) (← links)
- Solution of one problem of optimal partition of the vertex set of a hypergraph (Q3752416) (← links)
- On multigraphs with a given partition (Q5596089) (← links)
- Partitioning problems in dense hypergraphs (Q5957354) (← links)
- Partitions of hypergraphs under variable degeneracy constraints (Q6055378) (← links)
- Pull-push method: a new approach to edge-isoperimetric problems (Q6056726) (← links)