Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Graphs and Combinatorics

Search In Journal Title:

Abbravation: Graphs and Combinatorics

Search In Journal Abbravation:

Publisher

Springer Japan

Search In Publisher:

DOI

10.1007/bf02617305

Search In DOI:

ISSN

1435-5914

Search In ISSN:
Search In Title Of Papers:

Exponentially Many Monochromatic Emphasis Type="I

Authors: Ni Cao Han Ren
Publish Date: 2011/05/10
Volume: 28, Issue: 3, Pages: 309-314
PDF Link

Abstract

Erdös et al and Gerencsér et al had shown that in any 2edgecoloring of K 3n1 there is a nmatching containing edges with the same colorwe call such matching monochromatic matching In this paper we show that for any 2edgecoloring of K 3n1 there exists a monochromatic subgraph H of K 3n1 which contains exponentially many monochromatic nmatchings


Keywords:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:


Search Result: