E-viri
Odprti dostop
-
Krivelevich, Michael
arXiv (Cornell University), 05/2017Paper, Journal Article
We show that every locally sparse graph contains a linearly sized expanding subgraph. For constants \(c_1>c_2>1\), \(0<\alpha<1\), a graph \(G\) on \(n\) vertices is called a \((c_1,c_2,\alpha)\)-graph if it has at least \(c_1n\) edges, but every vertex subset \(W\subset V(G)\) of size \(|W|\le \alpha n\) spans less than \(c_2|W|\) edges. We prove that every \((c_1,c_2,\alpha)\)-graph with bounded degrees contains an induced expander on linearly many vertices. The proof can be made algorithmic. We then discuss several applications of our main result to random graphs, to problems about embedding graph minors, and to positional games.
Avtor
![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.