On the Lovász theta−number of almost regular graphs with application to Erdös−Rényi graphs
Autors principals: | Klerk, E, Newman, M, Pasechnik, D, Sotirov, R |
---|---|
Format: | Journal article |
Publicat: |
2009
|
Ítems similars
-
On the Lovász ϑ-number of almost regular graphs with application to Erdős–Rényi graphs
per: Sotirov, R., et al.
Publicat: (2012) -
Modularity of Erdos-Rényi random graphs
per: McDiarmid, C, et al.
Publicat: (2018) -
Shotgun assembly of Erdős-Rényi random graphs
per: Gaudio, Julia, et al.
Publicat: (2022) -
Moderate deviations of subgraph counts in the Erdős-Rényi random graphs G(n,m) and G(n,p)
per: Goldschmidt, C, et al.
Publicat: (2020) -
On Erdős sums of almost primes
per: Gorodetsky, O, et al.
Publicat: (2023)