Search ETDs:
Hypergraphs with restricted valency and matching number
Khare, Niraj

2010, Doctor of Philosophy, Ohio State University, Mathematics.
A set system is called k-homogeneous (also known as k-uniform) if and only if each
member has cardinality k. We find the maximum size of a k-homogeneous set system
for k = 2 and k = 3 subject to certain constraints such as restriction on maximum degree and maximum matching size. The bounds found in most cases are best possible,
i.e., there is a family that achieves the bound.
Akos Seress, PhD (Advisor)
Boris Pittel, PhD (Committee Member)
Neil Robertson, PhD (Committee Member)
131 p.

Recommended Citations

Hide/Show APA Citation

Khare, N. (2010). Hypergraphs with restricted valency and matching number. (Electronic Thesis or Dissertation). Retrieved from https://etd.ohiolink.edu/

Hide/Show MLA Citation

Khare, Niraj. "Hypergraphs with restricted valency and matching number." Electronic Thesis or Dissertation. Ohio State University, 2010. OhioLINK Electronic Theses and Dissertations Center. 25 Sep 2017.

Hide/Show Chicago Citation

Khare, Niraj "Hypergraphs with restricted valency and matching number." Electronic Thesis or Dissertation. Ohio State University, 2010. https://etd.ohiolink.edu/

Files

osu1275880336.pdf (437.47 KB) View|Download