Journal article icon

Journal article

Induced subgraphs of graphs with large chromatic number IX: rainbow paths

Abstract:

We prove that for all integers κ

,s0 there exists c with the following property. Let G be a graph with clique number at most κ and chromatic number more than c. Then for every vertex-colouring (not necessarily optimal) of G, some induced subgraph of G is an s-vertex path, and all its vertices have different colours. This extends a recent result of Gyárfá... Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Version of record

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Oxford college:
Merton College
Department:
Oxford, MPLS, Mathematical Institute
Seymour, P More by this author
Publisher:
Electronic Journal of Combinatorics Publisher's website
Journal:
Electronic Journal of Combinatorics Journal website
Volume:
24
Issue:
2
Pages:
#P2.53
Publication date:
2017-06-30
Acceptance date:
2017-06-22
EISSN:
1097-1440
Pubs id:
pubs:702716
URN:
uri:6c8487b8-dc9a-42b4-a1b6-d089887e58eb
UUID:
uuid:6c8487b8-dc9a-42b4-a1b6-d089887e58eb
Local pid:
pubs:702716
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