Staff View
Embedding spanning subgraphs into large dense graphs

Descriptive

TypeOfResource
Text
TitleInfo (ID = T-1)
Title
Embedding spanning subgraphs into large dense graphs
Identifier
ETD_2800
Identifier (type = hdl)
http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056417
Language
LanguageTerm (authority = ISO639-2); (type = code)
eng
Genre (authority = marcgt)
theses
Subject (ID = SBJ-1); (authority = RUETD)
Topic
Computer Science
Subject (ID = SBJ-2); (authority = ETD-LCSH)
Topic
Hamiltonian graph theory
Subject (ID = SBJ-3); (authority = ETD-LCSH)
Topic
Spanning trees (Graph theory)
Subject (ID = SBJ-4); (authority = ETD-LCSH)
Topic
Embeddings (Mathematics)
Abstract
In this thesis we are going to present some results on embedding spanning subgraphs into large dense graphs. Spanning Trees Bollob'as conjectured that if $G$ is a graph on $n$ vertices, $delta(G) geq (1/2 + epsilon) n$ for some $epsilon > 0$, and $T$ is a bounded degree tree on $n$ vertices, then $T$ is a subgraph of $G$. The problem was solved in the affirmative by Koml'os, S'ark"ozy and Szemer'edi for large graphs. They then strengthened their result, and showed that the maximum degree of $T$ need not be bounded: there exists a constant $c$ such that $T$ is a subgraph of $G$ if $Delta(T) leq cn / log n$, $delta(G) geq (1/2 + epsilon) n$ and $n$ is large. Both proofs are based on the Regularity Lemma-Blow-up Lemma Method. Recently, using other methods, it was shown that bounded degree trees embed into graphs with minimum degree $n/2 + C log n$, where $C$ is a constant depending on the maximum degree of $T$. Here we show that in general $n/2 + O(Delta(T) cdot log n)$ is sufficient for every $Delta(T) leq cn / log n$. We also show that this bound is tight for the two extreme values of $m$ i.e. when $m = C$ and when $m = cn / log n$. Powers of Hamiltonian Cycles In 1962 P'osa conjectured that if $delta(G) geq frac{2}{3}n$ then $G$ contains the square of a Hamiltonian cycle. Later, in 1974, Seymour generalized this conjecture: if $delta(G) geq (frac{k-1}{k})n$ then $G$ contains the $(k-1)$th power of a Hamiltonian cycle. In 1998 the conjecture was proved by Koml'os, S'ark"ozy and Szemer'edi for large graphs using the Regularity Lemma. We present a ``deregularised" proof of the P'osa-Seymour conjecture which results in a much lower threshold value for $n$, the size of the graph for which the conjecture is true. We hope that the tools used in this proof will push down the threshold value for $n$ to around 100 at which point we will be able to verify the conjecture for every $n$.
PhysicalDescription
Form (authority = gmd)
electronic resource
Extent
xi, 95 p. : ill.
InternetMediaType
application/pdf
InternetMediaType
text/xml
Note (type = degree)
Ph.D.
Note (type = bibliography)
Includes bibliographical references
Note (type = vita)
Includes vita
Note (type = statement of responsibility)
by Asif Jamshed
Name (ID = NAME-1); (type = personal)
NamePart (type = family)
Jamshed
NamePart (type = given)
Asif
Role
RoleTerm (authority = RULIB)
author
DisplayForm
Asif Jamshed
Name (ID = NAME-2); (type = personal)
NamePart (type = family)
Szemeredi
NamePart (type = given)
Endre
Role
RoleTerm (authority = RULIB)
chair
Affiliation
Advisory Committee
DisplayForm
Endre Szemeredi
Name (ID = NAME-3); (type = personal)
NamePart (type = family)
Steiger
NamePart (type = given)
William
Role
RoleTerm (authority = RULIB)
internal member
Affiliation
Advisory Committee
DisplayForm
William Steiger
Name (ID = NAME-4); (type = personal)
NamePart (type = family)
Grigoriadis
NamePart (type = given)
Michael
Role
RoleTerm (authority = RULIB)
internal member
Affiliation
Advisory Committee
DisplayForm
Michael Grigoriadis
Name (ID = NAME-5); (type = personal)
NamePart (type = family)
Abello
NamePart (type = given)
James
Role
RoleTerm (authority = RULIB)
outside member
Affiliation
Advisory Committee
DisplayForm
James Abello
Name (ID = NAME-1); (type = corporate)
NamePart
Rutgers University
Role
RoleTerm (authority = RULIB)
degree grantor
Name (ID = NAME-2); (type = corporate)
NamePart
Graduate School - New Brunswick
Role
RoleTerm (authority = RULIB)
school
OriginInfo
DateCreated (qualifier = exact)
2010
DateOther (qualifier = exact); (type = degree)
2010-10
Place
PlaceTerm (type = code)
xx
RelatedItem (type = host)
TitleInfo
Title
Rutgers University Electronic Theses and Dissertations
Identifier (type = RULIB)
ETD
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/T3MC8ZSD
Genre (authority = ExL-Esploro)
ETD doctoral
Back to the top

Rights

RightsDeclaration (AUTHORITY = GS); (ID = rulibRdec0006)
The author owns the copyright to this work.
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
RightsHolder (ID = PRH-1); (type = personal)
Name
FamilyName
Jamshed
GivenName
Asif
Role
Copyright Holder
RightsEvent (ID = RE-1); (AUTHORITY = rulib)
Type
Permission or license
DateTime
2010-08-04 19:06:06
AssociatedEntity (ID = AE-1); (AUTHORITY = rulib)
Role
Copyright holder
Name
Asif Jamshed
Affiliation
Rutgers University. Graduate School - New Brunswick
AssociatedObject (ID = AO-1); (AUTHORITY = rulib)
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.
Back to the top

Technical

ContentModel
ETD
MimeType (TYPE = file)
application/pdf
MimeType (TYPE = container)
application/x-tar
FileSize (UNIT = bytes)
573440
Checksum (METHOD = SHA1)
3851733be0841462f50e102097a59eeb5adda2d3
Back to the top
Version 8.3.13
Rutgers University Libraries - Copyright ©2020