Critical hypergraphs and intersecting set-pair systems

Research output: Contribution to journalArticle

37 Citations (Scopus)


A method is given for solving extremal problems of the following type: determine the maximal number of vertices in a class of hypergraphs. Results are applied for τ-critical and ν-critical hypergraphs.

Original languageEnglish
Pages (from-to)134-145
Number of pages12
JournalJournal of Combinatorial Theory, Series B
Issue number2
Publication statusPublished - Oct 1985


ASJC Scopus subject areas

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

Cite this