Name
Abstract | ||
|---|---|---|
To study how balanced or unbalanced a maximal intersecting family F⊆([n]r) is we consider the ratio R(F)=Δ(F)δ(F) of its maximum and minimum degree. We determine the order of magnitude of the function m(n,r), the minimum possible value of R(F), and establish some lower and upper bounds on the function M(n,r), the maximum possible value of R(F). To obtain constructions that show the bounds on m(n,r) we use a theorem of Blokhuis on the minimum size of a non-trivial blocking set in projective planes. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.disc.2012.10.007 | Discrete Mathematics |
Keywords | DocType | Volume |
Intersecting families,Maximum and minimum degree,Blocking sets | Journal | 313 |
Issue | ISSN | Citations |
2 | 0012-365X | 0 |
PageRank | References | Authors |
0.34 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zoltán lóránt Nagy | 1 | 13 | 3.55 |
| Lale Özkahya | 2 | 28 | 4.90 |
| Balázs Patkós | 3 | 85 | 21.60 |
| Máté Vizer | 4 | 27 | 14.06 |