We show that all the tangles in a finite graph or matroid can be distinguished by a single tree-decomposition that is invariant under the automorphisms of the graph or matroid. This comes as a corollary of a similar decomposition theorem for more general combinatorial structures, which has further applications. These include a new approach to cluster analysis and image segmentation. As another ...

The Ascending Subgraph Decomposition (ASD) Conjecture asserts that every graph G with ( n+1 2 ) edges admits an edge decomposition G = H1 ⊕ · · · ⊕Hn such that Hi has i edges and is isomorphic to a subgraph of Hi+1, i = 1, . . . , n−1. We show that every bipartite graph G with ( n+1 2 ) edges such that the degree sequence d1, . . . , dk of one of the stable sets satisfies di ≥ n − i + 2, 1 ≤ i ...

An even cycle decomposition of a graph is a partition of its edge into even cycles. We first give some results on the existence of even cycle decomposition in general 4-regular graphs, showing that K5 is not the only graph in this class without such a decomposition. Motivated by connections to the cycle double cover conjecture we go on to consider even cycle decompositions of line graphs of 2-c...

The decomposition of ethylene carbonate (EC) during the initial growth of solid-electrolyte interphase (SEI) films at the solvent-graphitic anode interface is critical to lithium ion battery operations. Ab initio molecular dynamics simulations of explicit liquid EC/graphite interfaces are conducted to study these electrochemical reactions. We show that carbon edge terminations are crucial at th...

Let L = {H1, H2, . . . ,Hr} be a family of subgraphs of a graph G. An L-decomposition of G is an edge-disjoint decomposition of G into positive integer αi copies of Hi, where i ∈ {1, 2, . . . , r}. Let Ck, Pk and Sk denote a cycle, a path and a star with k edges, respectively. In this paper, we prove that a balanced complete bipartite graph with 2n vertices has a {Ck, Pk, Sk}-decomposition if a...

A P3-decomposition of a graph is a partition of the edges of the graph into paths of length two. We give a necessary and sufficient condition for a semi-complete multigraph, that is a multigraph with at least one edge between each pair of vertices, to have a P3-decomposition. We show that this condition can be tested in strongly polynomial-time, and that the same condition applies to a larger c...

The Ascending Subgraph Decomposition (ASD) Conjecture asserts that every graph G with ( n+1 2 ) edges admits an edge decomposition G = H1 ⊕ · · · ⊕ Hn such that Hi has i edges and it is isomorphic to a subgraph of Hi+1, i = 1, . . . , n − 1. We show that every bipartite graph G with ( n+1 2 ) edges such that the degree sequence d1, . . . , dk of one of the stable sets satisfies di ≥ n − i + 1, ...