<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06121521</id>
  <dt>j</dt>
  <an>06121521</an>
  <augroup>
    <au>Nagy, Zolt\'an L\'or\'ant</au>
    <au>\"Ozkahya, Lale</au>
    <au>Patk\'os, Bal\'azs</au>
    <au>Vizer, M\'at\'e</au>
  </augroup>
  <ti>On the ratio of maximum and minimum degree in maximal intersecting families.</ti>
  <so>Discrete Math. 313, No. 2, 207-211 (2013).</so>
  <py>2013</py>
  <pu>Elsevier Science B.V. (North-Holland), Amsterdam</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>intersecting families</ut>
    <ut>maximum and minimum degree</ut>
    <ut>blocking sets</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/j.disc.2012.10.007</li>
  </ligroup>
  <abgroup>
    <ab>Summary: To study how balanced or unbalanced a maximal intersecting family $\cal F \subseteq \binom{[n]}{r}$ is we consider the ratio $\cal R(\cal F)=\frac {\Delta (\cal F)}{\delta (\cal F)}$ of its maximum and minimum degree. We determine the order of magnitude of the function $m(n,r)$, the minimum possible value of $\cal R(\cal F)$, and establish some lower and upper bounds on the function $M(n,r)$, the maximum possible value of $\cal R(\cal 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.</ab>
    <rv></rv>
  </abgroup>
</item>