CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems
Authors
András Gyárfás
Stanley Selkow
Gábor Sárközy
Publication date
1 January 2015
Publisher
'Springer Science and Business Media LLC'
Doi
Cite
Abstract
The typical problem in (generalized) Ramsey theory is to find the order of the largest monochromatic member of a family {Mathematical expression} (for example matchings, paths, cycles, connected subgraphs) that must be present in any edge coloring of a complete graph Kn with t colors. Another area is to find the minimum number of monochromatic members of {Mathematical expression} that partition or cover the vertex set of every edge colored complete graph. Here we propose a problem that connects these areas: for a fixed positive integers s ≤ t, at least how many vertices can be covered by the vertices of no more than s monochromatic members of {Mathematical expression} in every edge coloring of Kn with t colors. Several problems and conjectures are presented, among them a possible extension of a well-known result of Cockayne and Lorimer on monochromatic matchings for which we prove an initial step: every t-coloring of Kn contains a (t - 1)-colored matching of size k provided that {Mathematical expression} © 2013 Springer Japan
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Repository of the Academy's Library
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:real.mtak.hu:33630
Last time updated on 03/08/2016