Hypergraphs With Finitely Many Isomorphism Subtypes

DOI10.2307/2001007zbMATH Open0725.05063OpenAlexW4214610623MaRDI QIDQ5203065FDOQ5203065

Authors: H. A. Kierstead, Peter Nyikos 

Publication date: 1989

Full work available at URL: https://doi.org/10.2307/2001007

Recommendations

• scientific article; zbMATH DE number 3847439
• scientific article; zbMATH DE number 4010523
• Hypergraphs and Whitney's theorem on edge-isomorphisms of graphs
• Isomorphic edge disjoint subgraphs of hypergraphs
• On isomorphic subgraphs
• Counting substructures. II: Hypergraphs
• Minimal decompositions of hypergraphs into mutually isomorphic subhypergraphs
• Hypergraphs and hypergroups
• On the number of non-isomorphic subgraphs
• A 2-isomorphism theorem for hypergraphs

zbMATH Keywords

isomorphism types of induced subgraphsn-uniform infinite hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Model theory (03C99)

Cites Work

• Model theory
• Title not available (Why is that?)

Cited In (4)

• Relational structures having finitely many full-cardinality restrictions
• Elementarily \(\lambda\)-homogeneous binary functions
• On the number of non-isomorphic subgraphs
• Isomorphic edge disjoint subgraphs of hypergraphs

This page was built for publication: Hypergraphs With Finitely Many Isomorphism Subtypes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5203065)