Minimum H-decompositions of graphs: Edge-critical case
| dc.WoS.categories | Mathematics | en_US |
| dc.authorid | 0000-0001-6105-1694 | en_US |
| dc.authorid | 0000-0002-3091-3025 | en_US |
| dc.contributor.author | Özkahya, Lale | |
| dc.contributor.author | Person, Yury | |
| dc.date.accessioned | 2021-02-23T13:15:42Z | |
| dc.date.available | 2021-02-23T13:15:42Z | |
| dc.date.issued | 2012-05 | |
| dc.description.abstract | For a given graph H let phi(H)(n) be the maximum number of parts that are needed to partition the edge set of any graph on n vertices such that every member of the partition is either a single edge or it is isomorphic to H. Pikhurko and Sousa conjectured that phi(H)(n) = ex(n, H) for chi (H) >= 3 and all sufficiently large n, where ex(n, H) denotes the maximum size of a graph on n vertices not containing H as a subgraph. In this article, their conjecture is verified for all edge-critical graphs. Furthermore, it is shown that the graphs maximizing phi(H) (n) are (chi(H) - 1)-partite Turan graphs. (C) 2011 Elsevier Inc. All rights reserved. | en_US |
| dc.fullTextLevel | Full Text | en_US |
| dc.identifier.doi | 10.1016/j.jctb.2011.10.004 | en_US |
| dc.identifier.issn | 0095-8956 | |
| dc.identifier.scopus | 2-s2.0-84857627648 | en_US |
| dc.identifier.uri | https://hdl.handle.net/11411/3275 | |
| dc.identifier.uri | https://doi.org/10.1016/j.jctb.2011.10.004 | |
| dc.identifier.wos | WOS:000301619300009 | en_US |
| dc.identifier.wosquality | Q1 | en_US |
| dc.indekslendigikaynak | Web of Science | en_US |
| dc.indekslendigikaynak | Scopus | en_US |
| dc.issue | 3 | en_US |
| dc.language.iso | en | en_US |
| dc.national | International | en_US |
| dc.numberofauthors | 2 | en_US |
| dc.pages | 715-725 | en_US |
| dc.publisher | Academic Press Inc Elsevier Science | en_US |
| dc.relation.ispartof | Journal of Combinatorial Theory Series B | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Graph decomposition | en_US |
| dc.subject | Edge-critical | en_US |
| dc.subject | Turan graph | en_US |
| dc.subject | Stability approach | en_US |
| dc.title | Minimum H-decompositions of graphs: Edge-critical case | en_US |
| dc.type | Article | en_US |
| dc.volume | 102 | en_US |
