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

  • Edge-disjoint Linkages in Infinite Graphs 

    Assem Abd-AlQader Mahmoud, Amena (University of Waterloo, 2022-09-26)
    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 

    Rivera Omana, Fernanda (University of Waterloo, 2022-09-23)
    The objective of this thesis is to bound the number of points a $U_{2,\ell+2}$- and $M(K_{k+1})$-minor-free 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 

    Sun, Hao (University of Waterloo, 2022-09-20)
    Graph transversals are a classical branch of graph algorithms. In such a problem, one seeks a minimum-weight subset of nodes in a node-weighted graph $G$ which intersects all copies of subgraphs~$F$ from a fixed family ...
  • A Counterexample to a Conjecture About Trianle-Free Induced Subgraphs of Graphs with Large Chromatic Number 

    Carbonero, Alvaro; Hompe, Patrick; Moore, Benjamin; Spirkl, Sophie (Elsevier ScienceDirect, 2023-01)
    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 well-known conjecture. Our construction is a digraph with ...
  • Induced Subgraphs and Tree Decompositions III. Three-Path-Configurations and Logarithmic Treewidth. 

    Abrishami, Tara; Chudnovsky, Maria; Hajebi, Sepehr; Spirkl, Sophie (Advances in Combinatorics, 2022-09-09)
    A theta is a graph consisting of two non-adjacent 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 H-free if no induced subgraph of G is ...
  • Two combinatorial problems from craniosynostosis 

    Rundstrom, Mathieu Erik Charles (University of Waterloo, 2022-09-08)
    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 

    Kafer, Sean (University of Waterloo, 2022-09-01)
    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 

    Parham, Natalie (University of Waterloo, 2022-09-01)
    Constant-depth quantum circuits, or shallow quantum circuits, have been shown to exhibit behavior that is uniquely quantum. This thesis explores the power and limitations of constant-depth quantum circuits, in particular ...
  • Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph 

    Hajebi, Sepehr; Li, Yanjia; Spirkl, Sophie (Society for Industrial and Applied Mathematics, 2022-08-30)
    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 H-free if H is not isomorphic to an induced subgraph of ...
  • Local properties of graphs with large chromatic number 

    Davies, James (University of Waterloo, 2022-08-31)
    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 axis-aligned boxes and of lines in $\mathbb{R}^3$ ...
  • Algorithm Design for Ordinal Settings 

    Pulyassary, Haripriya (University of Waterloo, 2022-08-29)
    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 

    Ali, Irha (University of Waterloo, 2022-08-24)
    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 

    Hompe, Patrick (University of Waterloo, 2022-08-22)
    We show results in areas related to extremal problems in directed graphs. The first concerns a rainbow generalization of the Caccetta-H\"{a}ggkvist conjecture, made by Aharoni. The Caccetta-H\"{a}ggkvist conjecture states ...
  • Sandwich and probe problems for excluding paths 

    Figueiredo, Celina Miraglia Herrera de; Spirkl, Sophie (Elsevier, 2018-12-31)
    Let Pk denote an induced path on k vertices. For k ≥ 5, we show that the Pk-free sandwich problem, partitioned probe problem, and unpartitioned probe problem are NP-complete. For k ≤ 4, it is known that the Pk-free sandwich ...
  • Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs 

    Cheriyan, Joseph; Hajebi, Sepehr; Qu, Zishen; Spirkl, Sophie (Elsevier, 2022-07)
    In 1981, Duffus, Gould, and Jacobson showed that every connected graph either has a Hamiltonian path, or contains a claw (K1,3) or a net (a fixed six-vertex graph) as an induced subgraph. This implies that subject to being ...
  • On symmetric intersecting families of vectors 

    Eberhard, Sean; Kahn, Jeff; Narayanan, Bhargav; Spirkl, Sophie (Cambridge University Press, 2021-11)
    A family of vectors in [k]n is said to be intersecting if any two of its elements agree on at least one coordinate. We prove, for fixed k ≥ 3, that the size of any intersecting subfamily of [k]n invariant under a transitive ...
  • Modular relations of the Tutte symmetric function 

    Crew, Logan; Spirkl, Sophie (Elsevier, 2022-04)
    For a graph G, its Tutte symmetric function XBG generalizes both the Tutte polynomial TG and the chromatic symmetric function XG. We may also consider XB as a map from the t-extended Hopf algebra G[t] of labelled graphs ...
  • Finding Large H-Colorable Subgraphs in Hereditary Graph Classes 

    Chudnovsky, Maria; King, Jason; Pilipczuk, Michał; Rzążewski, Paweł; Spirkl, Sophie (Society for Industrial and Applied Mathematics, 2021-10-14)
    We study the Max Partial H-Coloring problem: given a graph G, find the largest induced subgraph of G that admits a homomorphism into H, where H is a fixed pattern graph without loops. Note that when H is a complete graph ...
  • A Complete Multipartite Basis for the Chromatic Symmetric Function 

    Crew, Logan; Spirkl, Sophie (Society for Industrial and Applied Mathematics, 2021-11-15)
    In the vector space of symmetric functions, the elements of the basis of elementary symmetric functions are (up to a factor) the chromatic symmetric functions of disjoint unions of cliques. We consider their graph complements, ...
  • Pure Pairs VI. Excluding an Ordered Tree. 

    Scott, Alex; Seymour, Paul; Spirkl, Sophie (Society for Industrial and Applied Mathematics Journal on Discrete Mathematics, 2022-01)
    A pure pair in a graph G is a pair (Z1,Z2) of disjoint sets of vertices such that either every vertex in Z1 is adjacent to every vertex in Z2, or there are no edges between Z1 and Z2. With Maria Chudnovsky, we recently ...

View more


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages