Math-1868 · mathematics · Combinatorics

Math-1868

Covering a symmetric crossing supermodular function with hyperedges of prescribed size

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

Let $V$ be finite and let $p:2^V\to\mathbb R$ be symmetric, meaning $p(X)=p(V\setminus X)$. Assume crossing supermodularity: $p(X)+p(Y)\le p(X\cap Y)+p(X\cup Y)$ whenever all four regions determined by $X,Y$ are nonempty. Specify positive integers $n_1,\ldots,n_k$.

Seek a criterion for the existence of an indexed hyperedge family $H_1,\ldots,H_k\subseteq V$ satisfying \[ |H_i|=n_i\quad(1\le i\le k),\qquad |\{i:H_i\cap X\ne\varnothing,\ H_i\setminus X\ne\varnothing\}| \ge p(X)\quad(X\subseteq V). \] Each hyperedge meeting both sides of a cut contributes one unit, irrespective of how many of its vertices lie on either side. Repeated hyperedges are permitted and count with their indices.

This is a feasibility characterization problem, not the assertion that every input is feasible. For example, $n_i>|V|$, a positive demand at $\varnothing$, or an excessive cut demand makes realization impossible. The result should provide sufficient as well as necessary conditions on the prescribed sizes and demands. The sizes can differ; treating only the equal-size case leaves the main additional difficulty. The convention on cut contribution is essential: counting separated vertex pairs of a hyperedge would define a different covering problem.

Short English statement

Characterize which symmetric crossing-supermodular cut demands can be realized by a hypergraph with a prescribed list of hyperedge sizes.

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.