Series Parallel Networks:  Three Questions
{'Code': '03040104', 'Directorate': {'LongName': 'Direct For Mathematical & Physical Scien'}, 'Division': {'LongName': 'Division Of Mathematical Sciences'}}
{'SignBlockName': 'Bernard McDonald'}
This research will concentrate on two questions in the                     theory of matroids and graph theory.  The first concerns the                    relationship between the number of independent k and k-1                        partitions of a matroid of size 2k associated to a series                       parallel graph.  The second problem is concerned with obtaining                 structure theorems for series parallel graphs.                                       This research is in combinatorics, the mathematical subject                which explores the relationships between certain special types of               subsets of finite sets.  This subject has recently flourished as                a result of the ever increasing interest in computational                       problems.  The current award, a planning grant, holds much                      promise of contributing much of interest in this area.
{'FirstName': 'Carolyn', 'LastName': 'Mahoney', 'EmailAddress': 'mahoney@lincolnu.edu', 'StartDate': '06/15/1987', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'Denison University', 'CityName': 'Granville', 'ZipCode': '430230000', 'PhoneNumber': '7405876679', 'StreetAddress': '100 W. College St.', 'CountryName': 'United States', 'StateName': 'Ohio', 'StateCode': 'OH'}
{'Code': '9120', 'Text': 'CROSS-DIRECTORATE PROGRAMS'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1987&All=true', 'xml': '8711447.xml'}