The inducibility of graphs

Nicholas Pippenger; Martin Charles Golumbic

doi:10.1016/0095-8956(75)90084-2

The inducibility of graphs

Nicholas Pippenger
, Martin Charles Golumbic

Research output: Contribution to journal › Article › peer-review

Abstract

We investigate the maximum number of ways in which a k-vertex graph G can appear as an induced subgraph of an n-vertex graph, for n ≥ k. When this number is expressed as a fraction of all k-vertex induced subgraphs, it tends to a definite limit as n → ∞. This limit, which we call the inducibility of G, is an effectively computable invariant of G. We examine the elementary properties of this invariant: its relationship to various operations on graphs, its maximum and minimum values, and its value for some particular graphs.

Original language	English
Pages (from-to)	189-203
Number of pages	15
Journal	Journal of Combinatorial Theory. Series B
Volume	19
Issue number	3
DOIs	https://doi.org/10.1016/0095-8956(75)90084-2
State	Published - Dec 1975
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1016/0095-8956(75)90084-2

Cite this

@article{3b0edbc601be4322b3a2989e58bd341a,

title = "The inducibility of graphs",

abstract = "We investigate the maximum number of ways in which a k-vertex graph G can appear as an induced subgraph of an n-vertex graph, for n ≥ k. When this number is expressed as a fraction of all k-vertex induced subgraphs, it tends to a definite limit as n → ∞. This limit, which we call the inducibility of G, is an effectively computable invariant of G. We examine the elementary properties of this invariant: its relationship to various operations on graphs, its maximum and minimum values, and its value for some particular graphs.",

author = "Nicholas Pippenger and Golumbic, \{Martin Charles\}",

year = "1975",

month = dec,

doi = "10.1016/0095-8956(75)90084-2",

language = "English",

volume = "19",

pages = "189--203",

journal = "Journal of Combinatorial Theory. Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

number = "3",

}

TY - JOUR

T1 - The inducibility of graphs

AU - Pippenger, Nicholas

AU - Golumbic, Martin Charles

PY - 1975/12

Y1 - 1975/12

N2 - We investigate the maximum number of ways in which a k-vertex graph G can appear as an induced subgraph of an n-vertex graph, for n ≥ k. When this number is expressed as a fraction of all k-vertex induced subgraphs, it tends to a definite limit as n → ∞. This limit, which we call the inducibility of G, is an effectively computable invariant of G. We examine the elementary properties of this invariant: its relationship to various operations on graphs, its maximum and minimum values, and its value for some particular graphs.

AB - We investigate the maximum number of ways in which a k-vertex graph G can appear as an induced subgraph of an n-vertex graph, for n ≥ k. When this number is expressed as a fraction of all k-vertex induced subgraphs, it tends to a definite limit as n → ∞. This limit, which we call the inducibility of G, is an effectively computable invariant of G. We examine the elementary properties of this invariant: its relationship to various operations on graphs, its maximum and minimum values, and its value for some particular graphs.

UR - https://www.scopus.com/pages/publications/49549143653

U2 - 10.1016/0095-8956(75)90084-2

DO - 10.1016/0095-8956(75)90084-2

M3 - Article

AN - SCOPUS:49549143653

SN - 0095-8956

VL - 19

SP - 189

EP - 203

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

IS - 3

ER -

The inducibility of graphs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this