Bounded fractionality of the multiflow feasibility problem for demand graph K3+K3 and related maximization problems

Authors:
Hiroshi Hirai
Affiliations:
Department of Mathematical Informatics, Graduate School of Information Science and Technology, University of Tokyo, Tokyo 113-8656, Japan
Venue:
Journal of Combinatorial Theory Series B
Year:
2012

Citing 5
Cited 0

Minimum (2,r)-metrics and integer multiflows

European Journal of Combinatorics - Special issue on discrete metric spaces
Minimum 0-extensions of graph metrics

European Journal of Combinatorics
Regular Article: Graphs of Some CAT(0) Complexes

Advances in Applied Mathematics
Tight spans of distances and the dual fractionality of undirected multiflow problems

Journal of Combinatorial Theory Series B
Half-integral five-terminus flows

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the multiflow feasibility problem whose demand graph is the vertex-disjoint union of two triangles. We show that this problem has a 1/12-integral solution whenever it is feasible and satisfies the Euler condition. This solves a conjecture raised by Karzanov, and completes the classification of the demand graphs having bounded fractionality. We reduce this problem to the multiflow maximization problem whose terminal weight is the graph metric of the complete bipartite graph, and show that it always has a 1/12-integral optimal multiflow for every inner Eulerian graph.