---
res:
  bibo_abstract:
  - "We show that a randomly perturbed digraph, where we start with a dense digraph
    Dα and add a small number of random edges to it, will typically contain a fixed
    orientation of a bounded-degree spanning tree. This answers a question posed by
    Araujo, Balogh, Krueger, Piga and Treglown and generalizes the corresponding result
    for randomly perturbed graphs by Krivelevich, Kwan and Sudakov. More specifically,
    we prove that there exists a constant c=c(α,Δ) such that if \r\nT is an oriented
    tree with maximum degree Δ and Dα is an n-vertex digraph with minimum semidegree
    αn, then the graph obtained by adding cn uniformly random edges to Dα will contain
    T with high probability.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Patryk
      foaf_name: Morawski, Patryk
      foaf_surname: Morawski
  - foaf_Person:
      foaf_givenName: Kalina H
      foaf_name: Petrova, Kalina H
      foaf_surname: Petrova
      foaf_workInfoHomepage: http://www.librecat.org/personId=554ff4e4-f325-11ee-b0c4-a10dbd523381
  bibo_doi: 10.37236/13316
  bibo_issue: '2'
  bibo_volume: 33
  dct_date: 2026^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/1077-8926
  dct_language: eng
  dct_publisher: Electronic Journal of Combinatorics@
  dct_title: Randomly perturbed digraphs also have bounded-degree spanning trees@
...