Hostname: page-component-7c8c6479df-xxrs7 Total loading time: 0 Render date: 2024-03-19T02:45:01.331Z Has data issue: false hasContentIssue false

Hereditary Properties of Triple Systems

Published online by Cambridge University Press:  17 March 2003

YOSHIHARU KOHAYAKAWA
Affiliation:
Instituto de Matemática e Estatística, Universidade de São Paulo, Rua do Matão 1010, 05508-090 São Paulo, SP, Brazil (e-mail: yoshi@ime.usp.br)
BRENDAN NAGLE
Affiliation:
University of Nevada, Reno, Nevada, USA (e-mail: nagle@math.gatech.edu)
VOJTĚCH RÖDL
Affiliation:
Department of Mathematics and Computer Science, Emory University, Atlanta, GA, 30032, USA (e-mail: rodl@mathcs.emory.edu)

Abstract

For an integer $s\ges 2$, a property $\P^{(s)}$ is an infinite class of s-uniform hypergraphs closed under isomorphism. We say that a property $\P^{(s)}$ is \emph{hereditary\/} if~$\P^{(s)}$ is closed under taking induced subhypergraphs. Thus, for some `forbidden class' $\FF=\{\F_i^{(s)}\:i\in I\}$ of s-uniform hypergraphs, $\P^{(s)}$ is the set of all s-uniform hypergraphs not containing any $\F_i^{(s)}\in\FF$ as an induced subhypergraph. Let $\P^{(s)}_n$ be those hypergraphs of $\P^{(s)}$ on some fixed n-vertex set. For a set of s-uniform hypergraphs $\FF=\{\F_i^{(s)}\:i\in I\}$, let

\[ \exind(n,\FF)=\max\bigl|[n]^s{\setminus}(\M\cup\N)\vphantom{\big|}\bigr|, \]

where the maximum is taken over all $\M$ and $\N\subseteq[n]^s$ with $\M\cap\N=\emptyset$ such that, for all $\G\subseteq[n]^s{\setminus}(\M\cup\N)$, no $\F_i^{(s)}\in\FF$ appears as an induced subhypergraph of $\G\cup\M$. We show that

\[ \log_2\big|\P^{(3)}_n\big|=\exind(n,\FF)+o(n^3) \]

holds for $s=3$ and any hereditary property $\P^{(3)}$, where $\FF$ is a forbidden class associated with $\P^{(3)}$. This result complements a collection of analogous theorems already proved for graphs (i.e., $s=2$).

Type
Research Article
Copyright
2003 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.)