Majority Colourings of Digraphs

Author(s): Kreutzer, Stephan; Oum, Sang-il; Seymour, Paul D.; van der Zypen, Dominic; Wood, David R

Download

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1kh3h

Full metadata record

DC Field	Value	Language
dc.contributor.author	Kreutzer, Stephan	-
dc.contributor.author	Oum, Sang-il	-
dc.contributor.author	Seymour, Paul D.	-
dc.contributor.author	van der Zypen, Dominic	-
dc.contributor.author	Wood, David R	-
dc.date.accessioned	2018-07-20T15:07:19Z	-
dc.date.available	2018-07-20T15:07:19Z	-
dc.date.issued	2017	en_US
dc.identifier.citation	Kreutzer, Stephan, Oum, Sang-il, Seymour, Paul, van der Zypen, Dominic, Wood, David R. (2017). Majority Colourings of Digraphs. ELECTRONIC JOURNAL OF COMBINATORICS, 24	en_US
dc.identifier.issn	1077-8926	-
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr1kh3h	-
dc.description.abstract	We prove that every digraph has a vertex 4-colouring such that for each vertex v, at most half the out-neighbours of v receive the same colour as v. We then obtain several results related to the conjecture obtained by replacing 4 by 3.	en_US
dc.language.iso	en	en_US
dc.relation.ispartof	ELECTRONIC JOURNAL OF COMBINATORICS	en_US
dc.rights	Final published version. This is an open access article.	en_US
dc.title	Majority Colourings of Digraphs	en_US
dc.type	Journal Article	en_US
dc.date.eissued	2017-05-19	en_US
pu.type.symplectic	http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article	en_US

Files in This Item:

File	Description	Size	Format
6410-20811-2-PB.pdf		286.97 kB	Adobe PDF	View/Download