Hypergraphs with finitely many isomorphism subtypes

Henry A. Kierstead; Peter J. Nyikos

doi:10.1090/S0002-9947-1989-0988883-8

Hypergraphs with finitely many isomorphism subtypes

Henry A. Kierstead, Peter J. Nyikos

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

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	https://doi.org/10.1090/S0002-9947-1989-0988883-8
State	Published - Apr 1989
Externally published	Yes

ASJC Scopus subject areas

Mathematics(all)
Applied Mathematics

Access to Document

10.1090/S0002-9947-1989-0988883-8

Fingerprint Dive into the research topics of 'Hypergraphs with finitely many isomorphism subtypes'. Together they form a unique fingerprint.

Cite this

@article{99e4f07ba9cb4cb18401e2c5a62f52a6,

title = "Hypergraphs with finitely many isomorphism subtypes",

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.",

author = "Kierstead, {Henry A.} and Nyikos, {Peter J.}",

year = "1989",

month = apr,

doi = "10.1090/S0002-9947-1989-0988883-8",

language = "English (US)",

volume = "312",

pages = "699--718",

journal = "Transactions of the American Mathematical Society",

issn = "0002-9947",

publisher = "American Mathematical Society",

number = "2",

}

TY - JOUR

T1 - Hypergraphs with finitely many isomorphism subtypes

AU - Kierstead, Henry A.

AU - Nyikos, Peter J.

PY - 1989/4

Y1 - 1989/4

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=14544283268&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=14544283268&partnerID=8YFLogxK

U2 - 10.1090/S0002-9947-1989-0988883-8

DO - 10.1090/S0002-9947-1989-0988883-8

M3 - Article

AN - SCOPUS:14544283268

VL - 312

SP - 699

EP - 718

JO - Transactions of the American Mathematical Society

JF - Transactions of the American Mathematical Society

SN - 0002-9947

IS - 2

ER -