Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-27T14:29:42.244Z Has data issue: false hasContentIssue false
  • English
  • Français

The Minimum Size of Saturated Hypergraphs

Published online by Cambridge University Press:  01 September 1999

OLEG PIKHURKO
OLEG PIKHURKO
Affiliation:
Department of Pure Mathematics and Mathematical Statistics, Cambridge University, Cambridge CB2 1SB, England (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

Let [Fscr ] be a family of forbidden k-hypergraphs (k-uniform set systems). An [Fscr ]-saturated hypergraph is a maximal k-uniform set system not containing any member of [Fscr ]. As the main result we prove that, for any finite family [Fscr ], the minimum number of edges of an [Fscr ]-saturated hypergraph is O(nk−1). In particular, this implies a conjecture of Tuza. Some other related results are presented.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 8 , Issue 5 , September 1999 , pp. 483 - 492
Copyright
1999 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.)