Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"Graph theory, combinatorics"”.
-
Erdos-Posa theorems for undirected group-labelled graphs
… approximate dualities for other families of graphs has since become a highly active area of research due in part to its algorithmic applications. In this thesis we investigate the Erdős-Pósa property of various families of constrained cycles and paths by developing new structural tools for …
-
Variations of Turán's theorem
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-11 without embargo terms
-
Extremal problems on special graph colorings
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2020-10-02 without embargo terms
-
Probabilistic Methods
The Probabilistic Method was primarily used in Combinatorics and pioneered by Erdös Pai, better known to Westerners as Paul Erdos in the 1950s. The probabilistic method is a powerful tool for solving many problems in discrete mathematics, combinatorics and also in graph .theory. It is also very …
-
The Chromatic Structure of Dense Graphs
This thesis focusses on extremal graph theory, the study of how local constraints on a graph affect its macroscopic structure. We primarily consider the chromatic structure: whether a graph has or is close to having some (low) chromatic number. Chapter 2 is the slight exception. We consider an …