Show simple item record

dc.contributor.advisorMubayi, Dhruven_US
dc.contributor.authorCooper, Jeffrey R.en_US
dc.date.accessioned2014-06-20T15:33:39Z
dc.date.available2014-06-20T15:33:39Z
dc.date.created2014-05en_US
dc.date.issued2014-06-20
dc.date.submitted2014-05en_US
dc.identifier.urihttp://hdl.handle.net/10027/18782
dc.description.abstractWe study the independence number and chromatic number of hypergraphs which contain no copies of a fixed subgraph. Let H be a 3-uniform hypergraph with maximum degree d. We show that if H contains no triangles, then the chromatic number of H is O(sqrt(d/log(d))). On the other hand, we give examples of hypergraphs which contain no copies of a fixed subgraph yet have independence number at most O(sqrt(d)).en_US
dc.language.isoenen_US
dc.rightsen_US
dc.rightsCopyright 2014 Jeffrey R. Cooperen_US
dc.subjecthypergraphsen_US
dc.subjectindependent setsen_US
dc.subjectchromatic numberen_US
dc.titleIndependent Sets in Sparse Hypergraphsen_US
thesis.degree.departmentMathematics, Statistics, and Computer Scienceen_US
thesis.degree.disciplineMathematicsen_US
thesis.degree.grantorUniversity of Illinois at Chicagoen_US
thesis.degree.levelDoctoralen_US
thesis.degree.namePhD, Doctor of Philosophyen_US
dc.type.genrethesisen_US
dc.contributor.committeeMemberLenz, Johnen_US
dc.contributor.committeeMemberReyzin, Leven_US
dc.contributor.committeeMemberTuran, Gyoryen_US
dc.contributor.committeeMemberDasGupta, Bhaskaren_US
dc.type.materialtexten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record