On Extending Hansel's Theorem to Hypergraphs
For integers $n \geq k \geq 2$, let $V$ be an $n$-element set, and let $\binom{V}{k}$ denote the family of all $k$-element subsets of $V$. For disjoint subsets $A, B \subseteq V$, we say that $\{A, B\}$ {\it covers} an element $K \in \binom{V}{k}$ if...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Scholar Commons
2017
|
| Subjects: | |
| Online Access: | http://scholarcommons.usf.edu/etd/7008 http://scholarcommons.usf.edu/cgi/viewcontent.cgi?article=8205&context=etd |