Finding any given 2‐factor in sparse pseudorandom graphs efficiently
Work
Year: 2020
Type: article
Abstract: Given an ‐vertex pseudorandom graph and an ‐vertex graph with maximum degree at most two, we wish to find a copy of in , that is, an embedding so that for all . Particular instances of this problem i... more
Source: Journal of Graph Theory
Institutions University of Rhode Island, Brazilian Society of Computational and Applied Mathematics, Universidade de São Paulo, Berlin Mathematical School, Freie Universität Berlin +1 more
Cites: 46
Cited by: 3
Related to: 10
FWCI: 0.687
Citation percentile (by year/subfield): 53.64
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funders Leverhulme Trust, Conselho Nacional de Desenvolvimento Científico e Tecnológico, Conselho Nacional de Desenvolvimento Científico e Tecnológico, Conselho Nacional de Desenvolvimento Científico e Tecnológico
Grant IDS SAS‐2017‐052\9, 310974/2013‐5, 311412/2018‐1, 423833/2018‐9