Edge-disjoint odd cycles in 4-edge-connected graphs
نویسندگان
چکیده
منابع مشابه
Edge-disjoint Odd Cycles in 4-edge-connected Graphs
Finding edge-disjoint odd cycles is one of the most important problems in graph theory, graph algorithm and combinatorial optimization. In fact, it is closely related to the well-known max-cut problem. One of the difficulties of this problem is that the Erdős-Pósa property does not hold for odd cycles in general. Motivated by this fact, we prove that for any positive integer k, there exists an ...
متن کاملEdge Disjoint Paths in Moderately Connected Graphs
We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as possible using paths that are mutually edge disjoint. This leads to a variety of classic NP-complete problems, for which approximability is not well understood. We show a polylogarithmic approximation algorithm for the undirected ...
متن کاملEdge-disjoint Hamilton cycles in random graphs
We show that provided log n/n ≤ p ≤ 1 − n−1/4 log n we can with high probability find a collection of bδ(G)/2c edge-disjoint Hamilton cycles in G ∼ Gn,p, plus an additional edge-disjoint matching of size bn/2c if δ(G) is odd. This is clearly optimal and confirms, for the above range of p, a conjecture of Frieze and Krivelevich.
متن کاملEdge Disjoint Hamilton Cycles in Knödel Graphs
All graphs considered here are simple and finite unless otherwise stated. LetCk (resp.Pk) denote the cycle (resp. path) on k vertices. For a graphG, if its edge set E(G) can be partitioned into E1,E2, . . . ,Ek such that 〈Ei〉 ∼= H, for all i, 1 ≤ i ≤ k, then we say thatH decomposesG.A k-factor ofG is a k-regular spanning subgraph of it. A k-factorization of a graphG is a partition of the edge s...
متن کاملEdge-disjoint Hamilton cycles in graphs
In this paper we give an approximate answer to a question of Nash-Williams from 1970: we show that for every α > 0, every sufficiently large graph on n vertices with minimum degree at least (1/2 + α)n contains at least n/8 edge-disjoint Hamilton cycles. More generally, we give an asymptotically best possible answer for the number of edge-disjoint Hamilton cycles that a graph G with minimum degr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2016
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2015.12.002