Math-1867 · mathematics · Combinatorics

Math-1867

Covering a crossing supermodular function with pairwise non-parallel arcs

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

Let $V$ be finite and $p:2^V\to\mathbb Z$ satisfy $p(\varnothing)=p(V)=0$. Call $p$ crossing supermodular if \[ p(X)+p(Y)\le p(X\cap Y)+p(X\cup Y) \] whenever $X\cap Y$, $X\setminus Y$, $Y\setminus X$, and $V\setminus(X\cup Y)$ are all nonempty. For a loopless digraph $D=(V,A)$, let $\rho_D(X)$ count arcs whose tail lies outside $X$ and whose head lies inside $X$.

Determine the minimum size of an arc set satisfying \[ \rho_D(X)\ge p(X)\quad(X\subseteq V),\qquad A\subseteq\{(u,v):u,v\in V,\ u\ne v\}. \] Thus each ordered pair may be used at most once, while the two opposite arcs $(u,v)$ and $(v,u)$ may both occur. Seek an effective feasibility criterion, a characterization of the optimal value, and an attaining construction; assign value $\infty$ when no feasible digraph exists.

The prohibition on parallel arcs is central. Unrestricted multiarc coverings obey different conditions and may meet demands that no simple digraph can meet. For example, a necessary condition here is $p(X)\le |X|\,|V\setminus X|$ for every $X$, but the problem asks for the complete interaction of all cut requirements, not just their individual upper bounds.

Short English statement

How many distinct directed arcs are needed to cover all demands of a crossing-supermodular function when repeated parallel arcs are forbidden?

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.