Delta-System Methods in Contemporary Graph Theory

Prince, Noah B.

Use this link to cite this item:

Files in this item

Files	Description	Format
application/pdf 3314867.pdf (1MB)	(no description provided)	PDF

Title:	Delta-System Methods in Contemporary Graph Theory
Author(s):	Prince, Noah B.
Doctoral Committee Chair(s):	West, Douglas B.
Department / Program:	Mathematics
Discipline:	Mathematics
Degree Granting Institution:	University of Illinois at Urbana-Champaign
Degree:	Ph.D.
Genre:	Dissertation
Subject(s):	Mathematics
Abstract:	Our 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.
Issue Date:	2008
Type:	Text
Language:	English
Description:	102 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008.
URI:	http://hdl.handle.net/2142/86902
Other Identifier(s):	(MiAaPQ)AAI3314867
Date Available in IDEALS:	2015-09-28
Date Deposited:	2008