E-viri
Recenzirano
-
Liebenau, Anita; Nenadov, Rajko
Journal of combinatorial theory. Series B, January 2022, 2022-01-00, Letnik: 152Journal Article
Let r≥4 be an integer and consider the following game on the complete graph Kn for n∈rZ: Two players, Maker and Breaker, alternately claim previously unclaimed edges of Kn such that in each turn Maker claims one and Breaker claims b∈N edges. Maker wins if her graph contains a Kr-factor, that is a collection of n/r vertex-disjoint copies of Kr, and Breaker wins otherwise. In other words, we consider a b-biased Kr-factor Maker–Breaker game. We show that the threshold bias for this game is of order n2/(r+2). This makes a step towards determining the threshold bias for making bounded-degree spanning graphs and extends a result of Allen et al. who resolved the case r∈{3,4} up to a logarithmic factor.
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Vnos na polico
Trajna povezava
- URL:
Faktor vpliva
Dostop do baze podatkov JCR je dovoljen samo uporabnikom iz Slovenije. Vaš trenutni IP-naslov ni na seznamu dovoljenih za dostop, zato je potrebna avtentikacija z ustreznim računom AAI.
Leto | Faktor vpliva | Izdaja | Kategorija | Razvrstitev | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Baze podatkov, v katerih je revija indeksirana
Ime baze podatkov | Področje | Leto |
---|
Povezave do osebnih bibliografij avtorjev | Povezave do podatkov o raziskovalcih v sistemu SICRIS |
---|
Vir: Osebne bibliografije
in: SICRIS
To gradivo vam je dostopno v celotnem besedilu. Če kljub temu želite naročiti gradivo, kliknite gumb Nadaljuj.