Abstract
Let K = (H, E) be an n-uniform infinite hypergraph such that the number of isomorphism types of induced subgraphs of K of cardinality λ is finite for some infinite λ. We solve a problem due independently to Jamison and Pouzet, by showing that there is a finite subset K of H such that the induced subgraph on H - K is either empty or complete. We also characterize such hypergraphs in terms of finite (not necessarily uniform) hypergraphs.
Original language | English (US) |
---|---|
Pages (from-to) | 699-718 |
Number of pages | 20 |
Journal | Transactions of the American Mathematical Society |
Volume | 312 |
Issue number | 2 |
DOIs | |
State | Published - Apr 1989 |
Externally published | Yes |
ASJC Scopus subject areas
- Mathematics(all)
- Applied Mathematics