On the number of distinct induced subgraphs of a graph

DOI10.1016/0012-365X(89)90085-XzbMath0668.05037WikidataQ126458144 ScholiaQ126458144MaRDI QIDQ1117948

Andras Hajnal

Publication date: 1989

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

zbMATH Keywords

induced subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items (8)

SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY ⋮ The multiplication table problem for bipartite graphs ⋮ Induced subgraphs of Ramsey graphs with many distinct degrees ⋮ On graphs with prescribed subgraphs of order $k$, and a theorem of Kelly and Merriell ⋮ Twin subgraphs and core-semiperiphery-periphery structures ⋮ Erdős and Rényi conjecture ⋮ Ramsey graphs contain many distinct induced subgraphs ⋮ Disjoint induced subgraphs of the same order and size

This page was built for publication: On the number of distinct induced subgraphs of a graph