Journal article icon

Journal article

The Erdős-Gyárfás problem on generalized Ramsey numbers

Abstract:

Fix positive integers p and q with 2 ≤ q ≤ (p2). An edge coloring of the complete graph Kn is said to be a (p, q)-coloring if every Kp receives at least q different colors. The function f(n, p, q) is the minimum number of colors that are needed for Kn to have a (p, q<...>

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted manuscript

Actions


Access Document


Files:
Publisher copy:
10.1112/plms/pdu049

Authors


More by this author
Institution:
University of Oxford
Oxford college:
Wadham College
Department:
Oxford, MPLS, Mathematical Institute
Sudakov, B More by this author
Publisher:
Wiley Publisher's website
Journal:
Proceedings of the London Mathematical Society Journal website
Volume:
110
Issue:
1
Pages:
1-18
Publication date:
2014-10-16
DOI:
EISSN:
1460-244X
ISSN:
0024-6115
Pubs id:
pubs:517577
URN:
uri:aa69bc2a-d9b4-4306-bec6-1c9a3c6ea160
UUID:
uuid:aa69bc2a-d9b4-4306-bec6-1c9a3c6ea160
Local pid:
pubs:517577
Keywords:

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP