Acyclic edge colourings of graphs with large girth

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/134649

Title:	Acyclic edge colourings of graphs with large girth
Author:	Cai, Xing Shi; Perarnau Llobet, Guillem; Reed, Bruce; Watts, Adam Bene
Other authors:	Universitat Politècnica de Catalunya. Departament de Matemàtiques; Universitat Politècnica de Catalunya. GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics
Abstract:	This is the peer reviewed version of the following article: Cai, X. S., Perarnau, G. , Reed, B. and Watts, A. B. (2017), Acyclic edge colourings of graphs with large girth. Random Struct. Alg., 50: 511-533. doi:10.1002/rsa.20695, which has been published in final form at https://doi.org/10.1002/rsa.20695. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions
Abstract:	An edge colouring of a graph G is called acyclic if it is proper and every cycle contains at least three colours. We show that for every e > 0, there exists a g = g(e) such that if G has maximum degree ¿ and girth at least g then G admits an acyclic edge colouring with (1 + e)¿+O(1) colours.
Subject(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs -Graph theory -Grafs, Teoria de
Rights:	Attribution-NonCommercial-NoDerivs 3.0 Spain http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Document type:	Article - Submitted version Article
Share: