ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG and HH be graphs. For graphs GG and HH, write [?][?] for the relative fractional packing number of GG with respect to HH, and let Expand(H)Expand(H) be the family of graphs obtained from HH by repeatedly removing vertices, adding edges, or replacing a vertex by a clique of arbitrary size. Relative fractional packing conjecture.

α∗(G∣H)≤1if and only ifG∈Expand(H).\alpha^{*}(G|H) \leq 1 \quad\text{if and only if}\quad G \in Expand(H).

The forward implication would characterize exactly when the relative fractional packing number is at most one in terms of the three graph-expansion operations; the reverse implication was already established in the preceding theorem. The conjecture is presented as open in the source.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.