On graphs with prescribed subgraphs of order $k$, and a theorem of Kelly and Merriell

DOI10.21136/cmj.1994.128498zbMath0821.05042OpenAlexW60759082MaRDI QIDQ4697504

Yair Caro

Publication date: 12 September 1995

Full work available at URL: https://eudml.org/doc/31445

zbMATH Keywords

partitionsvertex partitionisomorphic induced subgraphsKelly and Merriell's theoremprescribed subgraphsproperty-\((n, k, \ell)\)

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs

Cites Work

• On the number of distinct induced subgraphs of a graph
• Graphs with a small number of distinct induced subgraphs
• A Class of Graphs
• The Chromatic Number of Kneser Hypergraphs
• Unnamed Item
• Unnamed Item