Arboricity and tree-packing in locally finite graphs
نویسندگان
چکیده
منابع مشابه
Arboricity and tree-packing in locally finite graphs
Nash-Williams’ arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of ` vertices induces more than k(`− 1) edges. We prove a natural topological extension of this for locally finite infinite graphs, in which the partitioning forests are acyclic in the stronger sense that their Freudenthal compactification—the space obtained by adding their end...
متن کاملArboricity and spanning-tree packing in random graphs∗
We study the arboricity A and the maximum number T of edge-disjoint spanning trees of the classical random graph G (n, p). For all p(n) ∈ [0, 1], we show that, with high probability, T is precisely the minimum between δ and bm/(n − 1)c, where δ is the smallest degree of the graph and m denotes the number of edges. Moreover, we explicitly determine a sharp threshold value for p such that: above ...
متن کاملArboricity and spanning-tree packing in random graphs with an application to load balancing
We study the arboricity A and the maximum number T of edge-disjoint spanning trees of the Erdős-Rényi random graph G (n, p). For all p(n) ∈ [0, 1], we show that, with high probability, T is precisely the minimum between δ and bm/(n−1)c, where δ is the smallest degree of the graph and m denotes the number of edges. Moreover, we explicitly determine a sharp threshold value for p such that: above ...
متن کاملFinite locally-quasiprimitive graphs
A 1nite graph is said to be locally-quasiprimitive relative to a subgroup G of automorphisms if, for all vertices , the stabiliser in G of is quasiprimitive on the set of vertices adjacent to . (A permutation group is said to be quasiprimitive if all of its non-trivial normal subgroups are transitive.) The graph theoretic condition of local quasiprimitivity is strictly weaker than the condition...
متن کاملLinear Arboricity and Linear k-Arboricity of Regular Graphs
We find upper bounds on the linear k-arboricity of d-regular graphs using a probabilistic argument. For small k these bounds are new. For large k they blend into the known upper bounds on the linear arboricity of regular graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2006
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2005.08.003