On the number of non-isomorphic subgraphs

DOI10.1007/BF02773686zbMath0797.03051arXivmath/9401210OpenAlexW1979958861MaRDI QIDQ1327515

Saharon Shelah, Lajos Soukup

Publication date: 19 June 1994

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9401210

zbMATH Keywords

iterated forcingvertex decompositionAronszajn treesuncountable cliqueuncountable graphs

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Consistency and independence results (03E35) Other combinatorial set theory (03E05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Two chain conditions and their Todorčević's fragments of Martin's axiom

Cites Work

• Unnamed Item
• Proper forcing
• A weak version of \(\lozenge\) which follows from \(2^{\aleph_0}<2^{\aleph_1}\)
• Forcing with stable posets
• Hypergraphs With Finitely Many Isomorphism Subtypes
• The number of infinite substructures

This page was built for publication: On the number of non-isomorphic subgraphs