Loading...
Loading...

Go to the content (press return)

On star forest ascending subgraph decomposition

Author
Aroca, J.; Llado, A.
Type of activity
Journal article
Journal
Electronic journal of combinatorics
Date of publication
2017-02-03
Volume
24
Number
1
First page
1
Last page
12
Repository
http://hdl.handle.net/2117/112325 Open in new window
URL
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i1p14 Open in new window
Abstract
The Ascending Subgraph Decomposition (ASD) Conjecture asserts that every graph G with (n+12) 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+12) edges such that the degree sequence d1,…,dk of one of the stable sets satisfies dk-i=n-ifor each0=i=k-1, admits an ascending subgraph decomposition with star forests. We also give a necessary condition on the degree sequence w...
Citation
Aroca, J., Llado, A. On star forest ascending subgraph decomposition. "Electronic journal of combinatorics", 3 Febrer 2017, vol. 24, núm. 1, p. 1-12.
Keywords
Ascending graph decomposition
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications
GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics

Participants

Attachments