Home
Resource
On Erdős-Ko-Rado for random hypergraphs
PDF
PDF format is widely accepted and good for printing.
Plug-in required
PDF-1(488.94 kb)
Citation & Export
View Usage Statistics
Staff View

Citation & Export
Hide

Simple citation

Hamm, Arran. On Erdős-Ko-Rado for random hypergraphs. Retrieved from https://doi.org/doi:10.7282/T3GX491F

Export

Click here for information about Citation Management Tools at Rutgers.

Statistics
Hide

Description

TitleOn Erdős-Ko-Rado for random hypergraphs
NameHamm, Arran (author); Kahn, Jeff (chair); Kopparty, Swastik (internal member); Beck, Jozsef (internal member); Bohman, Tom (outside member); Rutgers University; Graduate School - New Brunswick
Date Created2014
Other Date2014-10 (degree)
SubjectMathematics, Hypergraphs
Extent1 online resource (vi, 71 p. : ill.)
DescriptionOn Erdős-Ko-Rado for Random Hypergraphs o by Arran Hamm Dissertation Director: Jeff Kahn Denote by Hk (n, p) the random k-graph in which each k-subset of {1, . . . , n} is present with probability p, independent of other choices. This dissertation addresses the question: for which p0 will Hk (n, p) satisfy the “Erd˝s-Ko-Rado property” provided that o p > p0 ? This question was first studied by Balogh, Bohman, and Mubayi where they dealt mainly with k < n 2 −γ (for some γ > 0). Our first main result gives the desired p0 when k < cn log(n) (for c < 1 ) and indeed contains the main results of Balogh et 4 1 al. concerning when Hk (n, p) satisfies EKR a.s. (that is, with probability tending to 1 as n → ∞). Additionally, more or less answering a question of Balogh et al., we show: there is a fixed ε > 0 such that if n = 2k + 1 and p > 1 − ε, then Hk (n, p) has the EKR property a.s. ii
NotePh.D.
NoteIncludes bibliographical references
Noteby Arran Hamm
Genretheses, ETD doctoral
Persistent URLhttps://doi.org/doi:10.7282/T3GX491F
Languageeng
CollectionGraduate School - New Brunswick Electronic Theses and Dissertations
Organization NameRutgers, The State University of New Jersey
RightsThe author owns the copyright to this work.
Version 8.5.5
Rutgers University Libraries - Copyright ©2024