Changes
Jump to:
navigation
,
search
Minimum k-way cut in a hypergraph
No change in size
,
16:15, 16 December 2011
[[Category:Edge-connectivity]]
[[Category:Open Problems]]
[[Category:Sub- and supermodular functions]]
[[Category:Open Problems]]
← Older edit
Newer edit →
Athos
Egresuser,
administrator
163
edits
Navigation menu
Personal tools
Log in
Namespaces
Special page
Variants
Views
More
Search
Navigation
Egres Open home
Recent changes
Discussions
All categories
Open problem list
Tidbits (our blog)
Random page
Notation
Help
Tools
Special pages
Printable version
Categories
▼
Chip-firing
(8 P)
▼
Colouring
(13 P)
▼
Cycles and paths
(10 P)
▼
Edge-connectivity
(21 P)
▼
Infinite combinatorics
(9 P)
▼
Integer polyhedra
(11 P)
▼
Matchings
(19 P)
▼
Matrices with indeterminates
(5 P)
▼
Matroids
(19 P)
▼
Node-connectivity
(7 P)
▼
Orientations
(15 P)
▼
Packing common bases
(7 P)
▼
Rigidity
(4 P)
▼
Stable matchings and kernels
(14 P)
▼
Sub- and supermodular functions
(11 P)
▼
Trees and branchings
(19 P)