Back to results
University of Illinois at Urbana-Champaign
Delta-System Methods in Contemporary Graph Theory
Abstract
dc:descriptionOur final problem is one in graph representations. We develop a lemma on traces of hypergraphs, extending results of Balogh and Bollobas. We then use this lemma, along with probabilistic methods, to show that for every positive integer k, almost every graph has no k-minimum-difference-representation. This answers a question of Boros, Gurvich, and Meshulam.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Mathematics
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2015
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Prince, Noah B.
- Contributors dc:contributor
-
- West, Douglas B.
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (MiAaPQ)AAI3314867
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/86902