On eliminating square paths in a square lattice

dc.contributor.advisorDean, Nathanielen_US
dc.creatorWilliams, Nikki LaTrinaen_US
dc.date.accessioned2009-06-04T06:34:59Zen_US
dc.date.available2009-06-04T06:34:59Zen_US
dc.date.issued2000en_US
dc.description.abstractRemoving the minimum number of vertices or points from a square lattice such that no square path exists is known as the square path problem. Finding this number as the size of the lattice increases is not so trivial. Results provided by Erdos-Posa and Bienstock-Dean provides an upper bound for eliminating all cycles from a planar graph but sheds little light on the case of the square lattice. This paper provides several values for the minimum number of vertices needed to be removed such that no square path exists.en_US
dc.format.extent41 p.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.callnoTHESIS MATH.SCI. 2000 WILLIAMSen_US
dc.identifier.citationWilliams, Nikki LaTrina. "On eliminating square paths in a square lattice." (2000) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/17386">https://hdl.handle.net/1911/17386</a>.en_US
dc.identifier.urihttps://hdl.handle.net/1911/17386en_US
dc.language.isoengen_US
dc.rightsCopyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.en_US
dc.subjectMathematicsen_US
dc.subjectOperations researchen_US
dc.subjectComputer scienceen_US
dc.titleOn eliminating square paths in a square latticeen_US
dc.typeThesisen_US
dc.type.materialTexten_US
thesis.degree.departmentMathematical Sciencesen_US
thesis.degree.disciplineEngineeringen_US
thesis.degree.grantorRice Universityen_US
thesis.degree.levelMastersen_US
thesis.degree.nameMaster of Artsen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
1399313.PDF
Size:
943.58 KB
Format:
Adobe Portable Document Format