Staff View
Stability results in additive combinatorics and graph theory

Descriptive

TitleInfo
Title
Stability results in additive combinatorics and graph theory
Name (type = personal)
NamePart (type = family)
Herdade
NamePart (type = given)
Simao
NamePart (type = date)
1984-
DisplayForm
Simao Herdade
Role
RoleTerm (authority = RULIB)
author
Name (type = personal)
NamePart (type = family)
Szemerédi
NamePart (type = given)
Endre
DisplayForm
Endre Szemerédi
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
chair
Name (type = personal)
NamePart (type = family)
Komlós
NamePart (type = given)
János
DisplayForm
János Komlós
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
internal member
Name (type = personal)
NamePart (type = family)
Steiger
NamePart (type = given)
William
DisplayForm
William Steiger
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
internal member
Name (type = personal)
NamePart (type = family)
Magyar
NamePart (type = given)
Ákos
DisplayForm
Ákos Magyar
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
outside member
Name (type = corporate)
NamePart
Rutgers University
Role
RoleTerm (authority = RULIB)
degree grantor
Name (type = corporate)
NamePart
Graduate School - New Brunswick
Role
RoleTerm (authority = RULIB)
school
TypeOfResource
Text
Genre (authority = marcgt)
theses
OriginInfo
DateCreated (qualifier = exact)
2015
DateOther (qualifier = exact); (type = degree)
2015-05
CopyrightDate (encoding = w3cdtf); (qualifier = exact)
2015
Place
PlaceTerm (type = code)
xx
Language
LanguageTerm (authority = ISO639-2b); (type = code)
eng
Abstract (type = abstract)
A general problem in Extremal Combinatorics asks about the maximum size of a collection of finite objects satisfying certain restrictions, and an ideal solution to it presents to you the objects which attain the maximum size. In several problems, it is the case that any large set satisfying the given property must be similar to one of the few extremal examples. Such stability results give us a complete understanding of the problem, and also make the result more flexible to be applied as a tool in other mathematical problems. Stability results in additive combinatorics and graph theory constitute the main topic of this thesis, in which we solve a question of Erdös and Sarközy on sums of integers, and reprove a conjecture of Posa and Seymour on powers of hamiltonian cycles. Along the way we prove stronger structural statements that have as a corollary the optimal solution to these problems. We also introduce a counting technique and two graph theory tools which we believe to be of great interest in their own right. Namely the Shifting Method, the Connecting Lemma, and a robust version of the classic Erdos-Stone Simonovits theorem.
Subject (authority = RUETD)
Topic
Mathematics
Subject (authority = ETD-LCSH)
Topic
Combinatorial analysis
Subject (authority = ETD-LCSH)
Topic
Stability
Subject (authority = ETD-LCSH)
Topic
Graph theory
RelatedItem (type = host)
TitleInfo
Title
Rutgers University Electronic Theses and Dissertations
Identifier (type = RULIB)
ETD
Identifier
ETD_6202
PhysicalDescription
Form (authority = gmd)
electronic resource
InternetMediaType
application/pdf
InternetMediaType
text/xml
Extent
1 online resource (vi, 73 p. : ill.)
Note (type = degree)
Ph.D.
Note (type = bibliography)
Includes bibliographical references
Note (type = statement of responsibility)
by Simao Herdade
RelatedItem (type = host)
TitleInfo
Title
Graduate School - New Brunswick Electronic Theses and Dissertations
Identifier (type = local)
rucore19991600001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/T30R9R7B
Genre (authority = ExL-Esploro)
ETD doctoral
Back to the top

Rights

RightsDeclaration (ID = rulibRdec0006)
The author owns the copyright to this work.
RightsHolder (type = personal)
Name
FamilyName
Herdade
GivenName
Simao
Role
Copyright Holder
RightsEvent
Type
Permission or license
DateTime (encoding = w3cdtf); (qualifier = exact); (point = start)
2015-03-05 11:11:44
AssociatedEntity
Name
Simao Herdade
Role
Copyright holder
Affiliation
Rutgers University. Graduate School - New Brunswick
AssociatedObject
Type
License
Name
Author Agreement License
Detail
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
Back to the top

Technical

RULTechMD (ID = TECHNICAL1)
ContentModel
ETD
OperatingSystem (VERSION = 5.1)
windows xp
Back to the top
Version 8.5.5
Rutgers University Libraries - Copyright ©2024