Use this URL to cite or link to this record in EThOS:
Title: Problems in combinatorics : paths in graphs, partial orders of fixed width
Author: Goodall, Sarah Jane
ISNI:       0000 0001 3504 8096
Awarding Body: London School of Economics and Political Science
Current Institution: London School of Economics and Political Science (University of London)
Date of Award: 1995
Availability of Full Text:
Access from EThOS:
Full text unavailable from EThOS. Please try the link below.
Access from Institution:
This thesis contains results in two areas, that is, graph theory and partial orders. (1) We consider graphs G with a specified subset W of vertices of large degree. We look for paths in G containing many vertices of W. The main results of the thesis are as follows. For G a graph on n vertices, and W of size w and minimum degree d, we show that there is always a path through at least vertices of W. We also prove some results for graphs in which only the degree sums of sets of independent vertices in W are known. (2) Let P = (X, ) be a poset on a set {1, 2,..., N}. Suppose X1 and X2 are a pair of disjoint chains in P whose union is X. Then P is a partial order of width two. A labelled poset is a partial order on a set {1, 2,..., N}. Suppose we have two labelled posets, P1 and P2, that are isomorphic. That is, there is a bijection between P1 and P2 which preserves all the order relations. Each isomorphism class of labelled posets corresponds to an unlabelled poset.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: Pure mathematics