Hostname: page-component-7dd5485656-gs9qr Total loading time: 0 Render date: 2025-10-31T06:29:12.858Z Has data issue: false hasContentIssue false
  • English
  • Français

Uniform Intersecting Families with Covering Number Restrictions

Published online by Cambridge University Press:  01 March 1998

P. FRANKL ,
K. OTA  and
N. TOKUSHIGE
P. FRANKL
Affiliation:
CNRS, ER 175 Combinatoire, 54 Bd Raspail, 75006 Paris, France
K. OTA
Affiliation:
Department of Mathematics, Keio University, 3-14-1 Hiyoshi, Kohoku-ku, Yokohama, 223 Japan (e-mail: ohta@comb.math.keio.ac.jp)
N. TOKUSHIGE
Affiliation:
College of Education, Ryukyu University, 1 Nishihara, Okinawa, 903/01 Japan (e-mail: hide@edu.u-ryukyu.ac.jp)
Get access Rights & Permissions [Opens in a new window]

Abstract

It is known that any k-uniform family with covering number t has at most ktt-covers. In this paper, we deal with intersecting families and give better upper bounds for the number of t-covers. Let pt(k) be the maximum number of t-covers in any k-uniform intersecting families with covering number t. We prove that, for a fixed t,

formula here

In the cases of t=4 and 5, we also prove that the coefficient of kt−1 in pt(k) is exactly (t2).

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 7 , Issue 1 , March 1998 , pp. 47 - 56
Copyright
1998 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable