Given k,n,m and univariate functions f_1,\ldots,f_n, find an k-uniform hypergraph on [n] with m edges maximizing \sum_{i=1}^n f_i(d_i), where d_i is the degree of vertex i.
Statement
Given k,n,m and univariate functions f_1,\ldots,f_n, find an k-uniform hypergraph on [n] with m edges maximizing \sum_{i=1}^n f_i(d_i), where d_i is the degree of vertex i. What is the complexity for graphs (k=2) when the functions are not necessarily identical?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.