Mostra el registre d'ítem simple
Decomposition of bounded degree graphs into C4-free subgraphs
| dc.contributor.author | Kang, Ross |
| dc.contributor.author | Perarnau Llobet, Guillem |
| dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
| dc.date.accessioned | 2019-06-11T08:59:30Z |
| dc.date.available | 2019-06-11T08:59:30Z |
| dc.date.issued | 2014-10-15 |
| dc.identifier.citation | Kang, R.; Perarnau-Llobet, G. Decomposition of bounded degree graphs into C4-free subgraphs. "European journal of combinatorics", 15 Octubre 2014, vol. 44, núm. Part A, p. 99-105. |
| dc.identifier.issn | 0195-6698 |
| dc.identifier.uri | http://hdl.handle.net/2117/134251 |
| dc.description.abstract | We prove that every graph with maximum degree ∆ admits a partition of its edges into O(√∆) parts (as ∆→∞) none of which contains C4 as a subgraph. This bound is sharp up to a constantfactor. Our proof uses an iterated random colouring procedure.Keywords: edge-colouring, graph decomposition, graphs of bounded maximum degree, degree Ramsey numbers,bipartite Turán numbers. MSC: 05C15, 05D40, 05C35, 05C55. |
| dc.format.extent | 7 p. |
| dc.language.iso | eng |
| dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
| dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria |
| dc.subject.lcsh | Combinatorial analysis |
| dc.subject.other | edge-colouring |
| dc.subject.other | graph decomposition |
| dc.subject.other | graphs of bounded maximum degree |
| dc.subject.other | degree Ramsey numbers |
| dc.subject.other | bipartite Turán number |
| dc.title | Decomposition of bounded degree graphs into C4-free subgraphs |
| dc.type | Article |
| dc.subject.lemac | Anàlisi combinatòria |
| dc.contributor.group | Universitat Politècnica de Catalunya. GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics |
| dc.identifier.doi | 10.1016/j.ejc.2014.09.009 |
| dc.relation.publisherversion | https://www.sciencedirect.com/science/article/pii/S019566981400153X |
| dc.rights.access | Open Access |
| local.identifier.drac | 24902808 |
| dc.description.version | Postprint (author's final draft) |
| local.citation.author | Kang, R.; Perarnau-Llobet, G. |
| local.citation.publicationName | European journal of combinatorics |
| local.citation.volume | 44 |
| local.citation.number | Part A |
| local.citation.startingPage | 99 |
| local.citation.endingPage | 105 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [104]
-
Articles de revista [3.261]