Skip to Main Content
Frequently Asked Questions
Submit an ETD
Global Search Box
Need Help?
Keyword Search
Participating Institutions
Advanced Search
School Logo
Files
File List
osu1275880336.pdf (437.47 KB)
ETD Abstract Container
Abstract Header
Hypergraphs with restricted valency and matching number
Author Info
Khare, Niraj
Permalink:
http://rave.ohiolink.edu/etdc/view?acc_num=osu1275880336
Abstract Details
Year and Degree
2010, Doctor of Philosophy, Ohio State University, Mathematics.
Abstract
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.
Committee
Akos Seress, PhD (Advisor)
Boris Pittel, PhD (Committee Member)
Neil Robertson, PhD (Committee Member)
Pages
131 p.
Subject Headings
Mathematics
Recommended Citations
Refworks
EndNote
RIS
Mendeley
Citations
Khare, N. (2010).
Hypergraphs with restricted valency and matching number
[Doctoral dissertation, Ohio State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=osu1275880336
APA Style (7th edition)
Khare, Niraj.
Hypergraphs with restricted valency and matching number.
2010. Ohio State University, Doctoral dissertation.
OhioLINK Electronic Theses and Dissertations Center
, http://rave.ohiolink.edu/etdc/view?acc_num=osu1275880336.
MLA Style (8th edition)
Khare, Niraj. "Hypergraphs with restricted valency and matching number." Doctoral dissertation, Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1275880336
Chicago Manual of Style (17th edition)
Abstract Footer
Document number:
osu1275880336
Download Count:
454
Copyright Info
© 2010, all rights reserved.
This open access ETD is published by The Ohio State University and OhioLINK.