On maximal intersecting families of finite sets

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

Let r be a positive integer. A finite family H of pairwise intersecting r-sets is a maximal clique of order r, if for any set A ∉ H, |A| ≤ r there exists a member E ε{lunate} H such that A ∩ E = {circled division slash}. For instance, a finite projective plane of order r - 1 is a maximal clique. Let N(r) denote the minimum number of sets in a maximal clique of order r. We prove N(r) ≤ 3 4r2 whenever a projective plane of order r 2 exists. This disproves the known conjecture N(r) ≥ r2 - r + 1.

Original languageEnglish
Pages (from-to)282-289
Number of pages8
JournalJournal of Combinatorial Theory, Series A
Volume28
Issue number3
DOIs
Publication statusPublished - May 1980

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Cite this