On the Lovász theta−number of almost regular graphs with application to Erdös−Rényi graphs

On the Lovász theta−number of almost regular graphs with application to Erdös−Rényi graphs

Bibliografski detalji
Glavni autori:	Klerk, E, Newman, M, Pasechnik, D, Sotirov, R
Format:	Journal article
Izdano:	2009

Slični predmeti

On the Lovász ϑ-number of almost regular graphs with application to Erdős–Rényi graphs
od: Sotirov, R., i dr.
Izdano: (2012)

Modularity of Erdos-Rényi random graphs
od: McDiarmid, C, i dr.
Izdano: (2018)

Shotgun assembly of Erdős-Rényi random graphs
od: Gaudio, Julia, i dr.
Izdano: (2022)

Moderate deviations of subgraph counts in the Erdős-Rényi random graphs G(n,m) and G(n,p)
od: Goldschmidt, C, i dr.
Izdano: (2020)

On Erdős sums of almost primes
od: Gorodetsky, O, i dr.
Izdano: (2023)

The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
od: Boix-Adserà, Enric, i dr.
Izdano: (2022)

The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs
od: Boix-Adsera, Enric, i dr.
Izdano: (2021)

Code for generating Erdos-Renyi Network Evolution Chains (ERNEC)
od: Farzaneh, A
Izdano: (2022)

A note on the stability number of an orthogonality graph
od: de Klerk, E, i dr.
Izdano: (2007)

Erdős–Hajnal for graphs with no 5-hole
od: Chudnovsky, M, i dr.
Izdano: (2023)

A note on the stability number of an orthogonality graph
od: Klerk, Etienne de., i dr.
Izdano: (2011)

Approximation of the stability number of a graph via copositive programming
od: de Klerk, E, i dr.
Izdano: (2002)

Towards Erdős-Hajnal for graphs with no 5-hole
od: Chudnovsky, M, i dr.
Izdano: (2019)

Two distance-regular graphs
od: Brouwer, Andries E., i dr.
Izdano: (2013)

Two distance−regular graphs
od: Brouwer, A, i dr.
Izdano: (2012)

Improved lower bounds for book crossing numbers of complete graphs
od: de Klerk, E, i dr.
Izdano: (2013)

Approximation of the stability number of a graph via copositive programming
od: Klerk, Etienne de., i dr.
Izdano: (2011)

Improved lower bounds on book crossing numbers of complete graphs
od: Salazar, G., i dr.
Izdano: (2014)

On the clique number of a strongly regular graph
od: Greaves, Gary Royden Watson, i dr.
Izdano: (2021)

Implementing Brouwer's database of strongly regular graphs
od: Cohen, N, i dr.
Izdano: (2016)

Almost-spanning universality in random graphs
od: Conlon, D, i dr.
Izdano: (2016)

Degrees in link graphs of regular graphs
od: Benjamini, I, i dr.
Izdano: (2022)

Book drawings of complete bipartite graphs
od: de Klerk, E, i dr.
Izdano: (2014)

Edge-regular graphs with regular cliques
od: Greaves, Gary Royden Watson, i dr.
Izdano: (2019)

On the factor-thickness of regular graphs
od: Peng, Yee Hock, i dr.
Izdano: (1989)

Modularity of regular and treelike graphs
od: McDiarmid, C, i dr.
Izdano: (2017)

Almost surely asymptotically constant graph neural networks
od: Adam-Day, S, i dr.
Izdano: (2024)

The Erdős-Gyárfás problem on generalized Ramsey numbers
od: Conlon, D, i dr.
Izdano: (2014)

Another construction of edge-regular graphs with regular cliques
od: Greaves, Gary Royden Watson, i dr.
Izdano: (2020)

On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function
od: de Klerk, E, i dr.
Izdano: (2004)

Bounds for graph regularity and removal lemmas
od: Conlon, David, i dr.
Izdano: (2013)

Regular Graphs with Many Triangles are Structured
od: Van der Hoorn, Pim, i dr.
Izdano: (2022)

Quadratically Regularized Optimal Transport on Graphs
od: Essid, Montacer, i dr.
Izdano: (2022)

Quadratically Regularized Optimal Transport on Graphs
od: Essid, Montacer, i dr.
Izdano: (2021)

Modularity in random regular graphs and lattices.
od: McDiarmid, C, i dr.
Izdano: (2013)

The number of disk graphs
od: McDiarmid, C, i dr.
Izdano: (2014)

The number of disk graphs.
od: McDiarmid, C, i dr.
Izdano: (2014)

On equicut graphs
od: Deza, M, i dr.
Izdano: (2001)

On equicut graphs
od: Deza, M, i dr.
Izdano: (2001)

Metastability of the Potts ferromagnet on random regular graphs
od: Coja-Oghlan, A, i dr.
Izdano: (2022)