The relative fractional packing characterization by graph expansion
Statement
Let and be graphs. For graphs and , write for the relative fractional packing number of with respect to , and let be the family of graphs obtained from by repeatedly removing vertices, adding edges, or replacing a vertex by a clique of arbitrary size. Relative fractional packing conjecture.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.