Combinatorics and Optimization
This is the collection for the University of Waterloo's Department of Combinatorics and Optimization .
Research outputs are organized by type (eg. Master Thesis, Article, Conference Paper).
Waterloo faculty, students, and staff can contact us or visit the UWSpace guide to learn more about depositing their research.
Recent deposits

Implicit Loss of Surjectivity and Facial Reduction: Theory and Applications
(University of Waterloo, 20230309)Facial reduction, pioneered by Borwein and Wolkowicz, is a preprocessing method that is commonly used to obtain strict feasibility in the reformulated, reduced constraint system. The importance of strict feasibility is ... 
The EdmondsGiles Conjecture and its Relaxations
(University of Waterloo, 20221223)Given a directed graph, a directed cut is a cut with all arcs oriented in the same direction, and a directed join is a set of arcs which intersects every directed cut at least once. Edmonds and Giles conjectured for all ... 
kConnectedness and kFactors in the SemiRandom Graph Process
(University of Waterloo, 20221220)The semirandom graph process is a singleplayer graph game where the player is initially presented an edgeless graph with n vertices. In each round, the player is offered a vertex u uniformly at random and subsequently ... 
Mixed Integer Programming Approaches for Group Decision Making
(University of Waterloo, 20221026)Group decision making problems are everywhere in our daytoday lives and have great influence on the daily operation of companies and institutions. With the recent advances in computational technology, it's not surprising ... 
Aspects of Quantum Field Theory in Enumerative Graph Theory
(University of Waterloo, 20221024)While a quantum field theorist has many uses for mathematics of all kinds, the relationship between quantum field theory and mathematics is far too fluid in the world of modern research to be described as the simple provision ... 
Digraphs with All Induced Directed Cycles of the Same Length are not → χ Bounded
(20221007)For t > 2, let us call a digraph D tchordal if all induced directed cycles in D have length equal to t. In an earlier paper, we asked for which t it is true that tchordal graphs with bounded clique number have bounded ... 
Enumerative perspectives on chord diagrams
(University of Waterloo, 20221007)The topic of this thesis is enumerating certain classes of chord diagrams, perfect matchings of the interval $\{1, 2, \ldots, 2n\}$. We consider hereditary classes of chord diagrams that are restricted to satisfy one of ... 
Edgedisjoint Linkages in Infinite Graphs
(University of Waterloo, 20220926)The main subject of this thesis is the infinite graph version of the weak linkage conjecture by Thomassen [24]. We first prove results about the structure of the lifting graph; Theorems 2.2.8, 2.2.24, and 2.3.1. As an ... 
Clique minors in dense matroids
(University of Waterloo, 20220923)The objective of this thesis is to bound the number of points a $U_{2,\ell+2}$ and $M(K_{k+1})$minorfree matroid has. We first prove that a sufficiently large matroid will contain a structure called a tower. We then use ... 
Transversal Problems In Sparse Graphs
(University of Waterloo, 20220920)Graph transversals are a classical branch of graph algorithms. In such a problem, one seeks a minimumweight subset of nodes in a nodeweighted graph $G$ which intersects all copies of subgraphs~$F$ from a fixed family ... 
A Counterexample to a Conjecture About TrianleFree Induced Subgraphs of Graphs with Large Chromatic Number
(Elsevier ScienceDirect, 202301)We prove that for every n, there is a graph G with χ(G) ≥ n and ω(G) ≤ 3 such that every induced subgraph H of G with ω(H) ≤ 2 satisfies χ(H) ≤ 4.This disproves a wellknown conjecture. Our construction is a digraph with ... 
Induced Subgraphs and Tree Decompositions III. ThreePathConfigurations and Logarithmic Treewidth.
(Advances in Combinatorics, 20220909)A theta is a graph consisting of two nonadjacent vertices and three internally disjoint paths between them, each of length at least two. For a family H of graphs, we say a graph G is Hfree if no induced subgraph of G is ... 
Two combinatorial problems from craniosynostosis
(University of Waterloo, 20220908)The art of cranial vault remodelling surgery is amazing and fascinating, but remains much of that, an art, to this day. In this thesis, we provide two mathematical approaches to tackle cranial vault remodelling surgery, ... 
Polyhedral Diameters and Applications to Optimization
(University of Waterloo, 20220901)The Simplex method is the most popular algorithm for solving linear programs (LPs). Geometrically, it moves from an initial vertex solution to an improving neighboring one, selected according to a pivot rule. Despite decades ... 
On the Power and Limitations of Shallow Quantum Circuits
(University of Waterloo, 20220901)Constantdepth quantum circuits, or shallow quantum circuits, have been shown to exhibit behavior that is uniquely quantum. This thesis explores the power and limitations of constantdepth quantum circuits, in particular ... 
Complexity Dichotomy for List5Coloring with a Forbidden Induced Subgraph
(Society for Industrial and Applied Mathematics, 20220830)For a positive integer r and graphs G and H, we denote by G+H the disjoint union of G and H and by rH the union of r mutually disjoint copies of H. Also, we say G is Hfree if H is not isomorphic to an induced subgraph of ... 
Local properties of graphs with large chromatic number
(University of Waterloo, 20220831)This thesis deals with problems concerning the local properties of graphs with large chromatic number in hereditary classes of graphs. We construct intersection graphs of axisaligned boxes and of lines in $\mathbb{R}^3$ ... 
Algorithm Design for Ordinal Settings
(University of Waterloo, 20220829)Social choice theory is concerned with aggregating the preferences of agents into a single outcome. While it is natural to assume that agents have cardinal utilities, in many contexts, we can only assume access to the ... 
Lattice Paths
(University of Waterloo, 20220824)This thesis is a survey of some of the well known results in lattice path theory. Chapter 1 looks into the history of lattice paths. That is, when it began and how it was popularized. Chapter 3 focuses on general lattices ... 
Cycles and coloring in graphs and digraphs
(University of Waterloo, 20220822)We show results in areas related to extremal problems in directed graphs. The first concerns a rainbow generalization of the CaccettaH\"{a}ggkvist conjecture, made by Aharoni. The CaccettaH\"{a}ggkvist conjecture states ...