Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

A ramsey-type theorem for multiple disjoint copies of induced subgraphs

100%

Nakamigawa T.

Discussiones Mathematicae Graph Theory

2014

tom 34

nr 2

249-261

Let k and ℓ be positive integers with ℓ ≤ k − 2. It is proved that there exists a positive integer c depending on k and ℓ such that every graph of order (2k−1−ℓ/k)n+c contains n vertex disjoint induced subgraphs, where these subgraphs are isomorphic to each other and they are isomorphic to one of four graphs: (1) a clique of order k, (2) an independent set of order k, (3) the join of a clique of order ℓ and an independent set of order k − ℓ, or (4) the union of an independent set of order ℓ and a clique of order k − ℓ.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Nakamigawa T.

1 2014

Wyniki wyszukiwania

A ramsey-type theorem for multiple disjoint copies of induced subgraphs