Name
Title | ||
|---|---|---|
An upper bound for the size of a k-uniform intersecting family with covering number k. |
Abstract | ||
|---|---|---|
Let r(k) denote the maximum number of edges in a k-uniform intersecting family with covering number k. Erdős and Lovász proved that ⌊k!(e−1)⌋≤r(k)≤kk. Frankl, Ota, and Tokushige improved the lower bound to r(k)≥(k/2)k−1, and Tuza improved the upper bound to r(k)≤(1−e−1+o(1))kk. We establish that r(k)≤(1+o(1))kk−1. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.jcta.2016.11.001 | Journal of Combinatorial Theory, Series A |
Keywords | Field | DocType |
Intersecting family,Intersecting hypergraph,Covering number,Blocking number,Transversal | Discrete mathematics,Combinatorics,Upper and lower bounds,Covering number,Mathematics | Journal |
Volume | ISSN | Citations |
147 | 0097-3165 | 0 |
PageRank | References | Authors |
0.34 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrii Arman | 1 | 1 | 1.05 |
| Troy Retter | 2 | 5 | 2.20 |