Show simple item record

Authordc.contributor.authorAllen, Peter 
Authordc.contributor.authorBöttcher, Julia 
Authordc.contributor.authorSkokan1, Jozef 
Authordc.contributor.authorStein, Maya 
Admission datedc.date.accessioned2020-04-23T15:13:52Z
Available datedc.date.available2020-04-23T15:13:52Z
Publication datedc.date.issued2020
Cita de ítemdc.identifier.citationRandom Struct Alg. 2020;56:306–338.es_ES
Identifierdc.identifier.issn1042-9832
Identifierdc.identifier.other10.1002/rsa.20851
Identifierdc.identifier.urihttps://repositorio.uchile.cl/handle/2250/174068
Abstractdc.description.abstractAdvancing the sparse regularity method, we prove one-sided and two-sided regularity inheritance lemmas for subgraphs of bijumbled graphs, improving on results of Conlon, Fox, and Zhao. These inheritance lemmas also imply improved H-counting lemmas for subgraphs of bijumbled graphs, for some H.es_ES
Lenguagedc.language.isoenes_ES
Publisherdc.publisherWileyes_ES
Type of licensedc.rightsAttribution-NonCommercial-NoDerivs 3.0 Chile*
Link to Licensedc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/cl/*
Sourcedc.sourceRandom Structures & Algorithmses_ES
Keywordsdc.subjectCounting lemmaes_ES
Keywordsdc.subjectPseudorandom graphses_ES
Keywordsdc.subjectRegularity inheritancees_ES
Keywordsdc.subjectSparse regularity lemmaes_ES
Keywordsdc.subjectSzemeredi's regularity lemmaes_ES
Títulodc.titleRegularity inheritance in pseudorandom graphses_ES
Document typedc.typeArtículo de revista
dcterms.accessRightsdcterms.accessRightsAcceso Abierto
Catalogueruchile.catalogadorapces_ES
Indexationuchile.indexArtículo de publicación ISIes_ES


Files in this item

Icon

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Chile
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 Chile