On the number of distinct induced subgraphs of a graph

P. Erdős, A. Hajnal

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

Let G be a graph on n vertices, i(G) the number of pairwise non-isomorphic induced subgraphs of G and k≥1. We prove that if i(G)=o(nk+1) then by omitting o(n) vertices the graph can be made (l,m)-almost canonical with l+m≤k+1.

Original languageEnglish
Pages (from-to)145-154
Number of pages10
JournalDiscrete Mathematics
Volume75
Issue number1-3
DOIs
Publication statusPublished - 1989

Fingerprint

Induced Subgraph
Distinct
Graph in graph theory
Pairwise

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

On the number of distinct induced subgraphs of a graph. / Erdős, P.; Hajnal, A.

In: Discrete Mathematics, Vol. 75, No. 1-3, 1989, p. 145-154.

Research output: Contribution to journalArticle

Erdős, P. ; Hajnal, A. / On the number of distinct induced subgraphs of a graph. In: Discrete Mathematics. 1989 ; Vol. 75, No. 1-3. pp. 145-154.
@article{313dfafc80924d978e2ac3f724427ef0,
title = "On the number of distinct induced subgraphs of a graph",
abstract = "Let G be a graph on n vertices, i(G) the number of pairwise non-isomorphic induced subgraphs of G and k≥1. We prove that if i(G)=o(nk+1) then by omitting o(n) vertices the graph can be made (l,m)-almost canonical with l+m≤k+1.",
author = "P. Erdős and A. Hajnal",
year = "1989",
doi = "10.1016/0012-365X(89)90085-X",
language = "English",
volume = "75",
pages = "145--154",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - On the number of distinct induced subgraphs of a graph

AU - Erdős, P.

AU - Hajnal, A.

PY - 1989

Y1 - 1989

N2 - Let G be a graph on n vertices, i(G) the number of pairwise non-isomorphic induced subgraphs of G and k≥1. We prove that if i(G)=o(nk+1) then by omitting o(n) vertices the graph can be made (l,m)-almost canonical with l+m≤k+1.

AB - Let G be a graph on n vertices, i(G) the number of pairwise non-isomorphic induced subgraphs of G and k≥1. We prove that if i(G)=o(nk+1) then by omitting o(n) vertices the graph can be made (l,m)-almost canonical with l+m≤k+1.

UR - http://www.scopus.com/inward/record.url?scp=0039605746&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0039605746&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(89)90085-X

DO - 10.1016/0012-365X(89)90085-X

M3 - Article

VL - 75

SP - 145

EP - 154

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -