18 research outputs found
Packing odd -joins with at most two terminals
Take a graph , an edge subset , and a set of
terminals where is even. The triple is
called a signed graft. A -join is odd if it contains an odd number of edges
from . Let be the maximum number of edge-disjoint odd -joins.
A signature is a set of the form where and is even. Let be the minimum cardinality a -cut
or a signature can achieve. Then and we say that
packs if equality holds here.
We prove that packs if the signed graft is Eulerian and it
excludes two special non-packing minors. Our result confirms the Cycling
Conjecture for the class of clutters of odd -joins with at most two
terminals. Corollaries of this result include, the characterizations of weakly
and evenly bipartite graphs, packing two-commodity paths, packing -joins
with at most four terminals, and a new result on covering edges with cuts.Comment: extended abstract appeared in IPCO 2014 (under the different title
"the cycling property for the clutter of odd st-walks"
The Cycling Property for the Clutter of Odd st-Walks
A binary clutter is cycling if its packing and covering linear program have integral optimal solutions for all Eulerian edge capacities. We prove that the clutter of odd st- walks of a signed graph is cycling if and only if it does not contain as a minor the clutter of odd circuits of K5 nor the clutter of lines of the Fano matroid. Corollaries of this result include, of many, the characterization for weakly bipartite signed graphs, packing two- commodity paths, packing T-joins with small |T|, a new result on covering odd circuits of a signed graph, as well as a new result on covering odd circuits and odd T-joins of a signed graft
Hamilton cycles in 5-connected line graphs
A conjecture of Carsten Thomassen states that every 4-connected line graph is
hamiltonian. It is known that the conjecture is true for 7-connected line
graphs. We improve this by showing that any 5-connected line graph of minimum
degree at least 6 is hamiltonian. The result extends to claw-free graphs and to
Hamilton-connectedness
Packing six T-joins in plane graphs
Let G be a plane graph and T an even subset of its vertices. It
has been conjectured that if all T-cuts of G have the same parity and
the size of every T-cut is at least k, then G contains k edge-disjoint
T-joins. The case k = 3 is equivalent to the Four Color Theorem, and
the cases k = 4, which was conjectured by Seymour, and k = 5 were
proved by Guenin. We settle the next open case k = 6
Pairwise disjoint perfect matchings in -edge-connected -regular graphs
Thomassen [Problem 1 in Factorizing regular graphs, J. Combin. Theory Ser. B,
141 (2020), 343-351] asked whether every -edge-connected -regular graph
of even order has pairwise disjoint perfect matchings. We show that this
is not the case if . Together with a recent result
of Mattiolo and Steffen [Highly edge-connected regular graphs without large
factorizable subgraphs, J. Graph Theory, 99 (2022), 107-116] this solves
Thomassen's problem for all even . It turns out that our methods are limited
to the even case of Thomassen's problem. We then prove some equivalences of
statements on pairwise disjoint perfect matchings in highly edge-connected
regular graphs, where the perfect matchings contain or avoid fixed sets of
edges. Based on these results we relate statements on pairwise disjoint perfect
matchings of 5-edge-connected 5-regular graphs to well-known conjectures for
cubic graphs, such as the Fan-Raspaud Conjecture, the Berge-Fulkerson
Conjecture and the -Cycle Double Cover Conjecture.Comment: 24 page