Graphs with a small number of distinct induced subgraphs

DOI10.1016/0012-365X(89)90074-5zbMath0681.05060MaRDI QIDQ1823262

Noga Alon, Béla Bollobás

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

stable setindependent set of verticesisomorphism number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Related Items

Complementary eigenvalues of graphs, Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues, The multiplication table problem for bipartite graphs, Induced subgraphs of Ramsey graphs with many distinct degrees, Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture, A bipartite version of the Erdős–McKay conjecture, Repetition of spectral radiuses among connected induced subgraphs, Spectral radii of friendship graphs and their connected induced subgraphs, On graphs with prescribed subgraphs of order $k$, and a theorem of Kelly and Merriell, Twin subgraphs and core-semiperiphery-periphery structures, On cardinality of complementarity spectra of connected graphs, The parameterized complexity of \(k\)-edge induced subgraphs, Anticoncentration for subgraph statistics, Erdős and Rényi conjecture, Proof of a conjecture on induced subgraphs of Ramsey graphs, Ramsey graphs contain many distinct induced subgraphs, Disjoint induced subgraphs of the same order and size

Cites Work

• On generalized graphs
• Unnamed Item