scientific article; zbMATH DE number 15666
[For the entire collection see Zbl 0706.00007.] H. Kierstead and P. Nyikos proved that if an \(n\)-uniform hypergraph \(G\) on \(\alpha\) vertices is isomorphic to each of its induced subgraphs on \(\alpha\) vertices then \(G\) is either empty nor complete. In the paper under review it is shown that if \(G\) is a graph on \(\omega_ 1\) which is neither complete nor empty then the number of all isomorphism classes of induced subgraphs of \(G\) on \(\omega_ 1\) is at least \(2^ \omega\). In addition a construction of a non-trivial graph \(G\) on \(\omega_ 1\) with the property that \(G\) is isomorphic to \(G[W]\) whenever \(W\subset V(G)\) with \(| V(G)\backslash W|<| V(G)|\).
- On the number of graphs without large cliques
- On graphs with subgraphs having large independence numbers
- Independence number of graphs with a prescribed number of cliques
- A note on independent sets in graphs with large minimum degree and small cliques
- Clique-factors in graphs with sublinear -independence number
- Large independent sets in subquartic planar graphs
- On the minimum number of k-cliques in graphs with restricted independence number
- On the densities of cliques and independent sets in graphs
- Independent sets, cliques, and colorings in graphons
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972310)
