Back to search

University of British Columbia

New results on some Erdős-Ko-Rado-type problems

Abstract

dc:description

In this thesis, we study two longstanding problems in extremal set theory related to the Erdős-Ko-Rado theorem. In these problems, we have a collection F of k-subsets of an n-set that contains no copy of some forbidden substructure. The forbidden substructures in question here are known as clusters and simplices and are defined according to intersection and union constraints. The cluster conjecture that we consider was made by Mubayi in 2006 and the simplex conjecture was made in 1974 by Chvátal. We resolve completely the first of these two conjectures, and resolve the second for all but very small values of n.

Degree

thesis:*
Name thesis:degree_name
Master of Science - MSc
Level thesis:degree_level
master's
Discipline thesis:degree_discipline
Mathematics
Grantor dc:publisher
University of British Columbia
Year dc:date
2021

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Currier, Gabriel
Contributors dc:contributor
  • Anstee, Richard
  • Solymosi, Jozsef, 1959-

Rights

dc:rights
Statement dc:rights
  • Attribution-NonCommercial-NoDerivatives 4.0 International
Language dc:language
eng

Identifiers

dc:identifier.*
Handle dc:identifier
http://hdl.handle.net/2429/79305

Chain of custody

source
Harvested from
University of British Columbia
Base URL
circle.library.ubc.ca/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Currier, Gabriel. New results on some Erdős-Ko-Rado-type problems. master's thesis, University of British Columbia, 2021. http://hdl.handle.net/2429/79305