Upper bound on the order of τ-critical hypergraphs

Research output: Contribution to journalArticle

8 Citations (Scopus)


The right order of magnitude for the maximal number of vertices in an r-uniform τ-critical hypergraph H is achieved by obtaining an upper bound of O(τ(H)r-1).

Original languageEnglish
Pages (from-to)161-165
Number of pages5
JournalJournal of Combinatorial Theory, Series B
Issue number2
Publication statusPublished - Oct 1982

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Upper bound on the order of τ-critical hypergraphs'. Together they form a unique fingerprint.

  • Cite this