Search
Now showing items 1-1 of 1
On the ascending subgraph decomposition problem for bipartite graphs
(2017-09-11)
The Ascending Subgraph Decomposition (ASD) Conjecture asserts that every graph
G with
n+1
2
edges admits an edge decomposition G = H
has i edges and is isomorphic to a subgraph of H
i+1
1
⊕· · · ⊕H
, i = 1, ...