---
res:
  bibo_abstract:
  - "We consider a recently introduced model of color-avoiding percolation (abbreviated
    CA-percolation) defined as follows. Every edge in a graph G is colored in some
    of k>=2 colors. Two vertices u and v in G are said to be CA-connected if u and
    v may be connected using any subset of k-1 colors. CA-connectivity defines an
    equivalence relation on the vertex set of G whose classes are called CA-components.\r\nWe
    study the component structure of a randomly colored Erdős–Rényi random graph of
    constant average degree. We distinguish three regimes for the size of the largest
    component: a supercritical regime, a so-called intermediate regime, and a subcritical
    regime, in which the largest CA-component has respectively linear, logarithmic,
    and bounded size. Interestingly, in the subcritical regime, the bound is deterministic
    and given by the number of colors.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Lyuben
      foaf_name: Lichev, Lyuben
      foaf_surname: Lichev
      foaf_workInfoHomepage: http://www.librecat.org/personId=9aa8388e-d003-11ee-8458-c4c1d7447977
  - foaf_Person:
      foaf_givenName: Bruno
      foaf_name: Schapira, Bruno
      foaf_surname: Schapira
  bibo_doi: 10.5802/ahl.228
  bibo_volume: 8
  dct_date: 2025^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/2644-9463
  dct_language: eng
  dct_publisher: École normale supérieure de Rennes@
  dct_title: Color-avoiding percolation on the Erdős–Rényi random graph@
...