Mostra el registre d'ítem simple
Existence of spanning F-free subgraphs with large minimum degree
dc.contributor.author | Perarnau Llobet, Guillem |
dc.contributor.author | Reed, Bruce |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2020-03-20T09:36:07Z |
dc.date.issued | 2016-12-07 |
dc.identifier.citation | Perarnau-Llobet, G.; Reed, B. Existence of spanning F-free subgraphs with large minimum degree. "Combinatorics probability and computing", 7 Desembre 2016, vol. 26, núm. 3, p. 448-467. |
dc.identifier.issn | 0963-5483 |
dc.identifier.other | https://arxiv.org/abs/1404.7764 |
dc.identifier.uri | http://hdl.handle.net/2117/180661 |
dc.description.abstract | Let F be a family of graphs and let d be large enough. For every d-regular graph G, we study the existence of a spanning F-free subgraph of G with large minimum degree. This problem is well understood if F does not contain bipartite graphs. Here we provide asymptotically tight results for many families of bipartite graphs such as cycles or complete bipartite graphs. To prove these results, we study a locally injective analogue of the question. |
dc.format.extent | 20 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs |
dc.subject.lcsh | Graph theory |
dc.subject.lcsh | Discrete mathematics |
dc.subject.lcsh | Combinatorial analysis |
dc.title | Existence of spanning F-free subgraphs with large minimum degree |
dc.type | Article |
dc.subject.lemac | Grafs, Teoria de |
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.1017/S0963548316000328 |
dc.relation.publisherversion | https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/existence-of-spanning-free-subgraphs-with-large-minimum-degree/699F50FECEE9E9DDA2984E82748368C8 |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 24902867 |
dc.description.version | Postprint (author's final draft) |
dc.date.lift | 10000-01-01 |
local.citation.author | Perarnau-Llobet, G.; Reed, B. |
local.citation.publicationName | Combinatorics probability and computing |
local.citation.volume | 26 |
local.citation.number | 3 |
local.citation.startingPage | 448 |
local.citation.endingPage | 467 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [104]
-
Articles de revista [3.261]