Staff View
Obstacles, slopes and tic-tac-toe

Descriptive

TitleInfo
Title
Obstacles, slopes and tic-tac-toe
SubTitle
an excursion in discrete geometry and combinatorial game theory
Name (type = personal)
NamePart (type = family)
Mukkamala
NamePart (type = given)
V S Padmini
NamePart (type = date)
1983-
DisplayForm
V S Padmini Mukkamala
Role
RoleTerm (authority = RULIB)
author
Name (type = personal)
NamePart (type = family)
Szegedy
NamePart (type = given)
Mario
DisplayForm
Mario Szegedy
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
chair
Name (type = personal)
NamePart (type = family)
Pach
NamePart (type = given)
Janos
DisplayForm
Janos Pach
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
co-chair
Name (type = personal)
NamePart (type = family)
Beck
NamePart (type = given)
Jozsef
DisplayForm
Jozsef Beck
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 = 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)
2011
DateOther (qualifier = exact); (type = degree)
2011-10
Place
PlaceTerm (type = code)
xx
Language
LanguageTerm (authority = ISO639-2b); (type = code)
eng
Abstract (type = abstract)
The minimum number of slopes used in a straight-line drawing of G is called the slope number of G. We show that every cubic graph can be drawn in the plane with straight line edges using only the four basic slopes {0, π/4, π/2,−π/4}. We also prove that four slopes have this property if and only if we can draw K4 with them. Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of obstacles (connected polygons)
such that two vertices of G are joined by an edge if and only if the corresponding points can be connected by a segment which avoids all obstacles. The obstacle number of G is the minimum number of obstacles in an obstacle representation of G. We show that there are graphs on n vertices with obstacle number (n/log n). We show that there is an m = 2n + o(n), such that, in the Maker-Breaker game played on Zd where Maker needs to put at least m of his marks consecutively in one
of n given winning directions, Breaker can force a draw using a pairing strategy. This improves the result of Kruczek and Sundberg who showed that such a pairing strategy exits if m ≥ 3n. A simple argument shows that m has to be at least 2n+1 if Breaker is only allowed to use a pairing strategy, thus the main term of our bound is optimal.
Subject (authority = RUETD)
Topic
Mathematics
Subject (authority = ETD-LCSH)
Topic
Combinatorial analysis
Subject (authority = ETD-LCSH)
Topic
Discrete geometry
Subject (authority = ETD-LCSH)
Topic
Mathematical models
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
Identifier
ETD_3564
Identifier (type = hdl)
http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000063727
PhysicalDescription
Form (authority = gmd)
electronic resource
InternetMediaType
application/pdf
InternetMediaType
text/xml
Extent
vii, 71 p. : ill.
Note (type = degree)
Ph.D.
Note (type = bibliography)
Includes bibliographical references
Note (type = vita)
Includes vita
Note (type = statement of responsibility)
by V S Padmini Mukkamala
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/T3XD10QD
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
Mukkamala
GivenName
V S Padmini
Role
Copyright Holder
RightsEvent
Type
Permission or license
DateTime (encoding = w3cdtf); (qualifier = exact); (point = start)
2011-09-15 13:55:12
AssociatedEntity
Name
V S Padmini Mukkamala
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

FileSize (UNIT = bytes)
550912
OperatingSystem (VERSION = 5.1)
windows xp
ContentModel
ETD
MimeType (TYPE = file)
application/pdf
MimeType (TYPE = container)
application/x-tar
FileSize (UNIT = bytes)
552960
Checksum (METHOD = SHA1)
398927380bcbe8510d2fc6fc17216d6de53cd959
Back to the top
Version 8.3.13
Rutgers University Libraries - Copyright ©2020