On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs
type: Item
instance of: scholarly article
title: On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs
zbMATH Open document ID: 1200.05163
author: Mike Newman
author: E. de Klerk
author: Dmitrii V. Pasechnik
author: Renata Sotirov
published in: European Journal of Combinatorics
publication date: 2009-06-17T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5565533
describes a project that uses: SeDuMi
MaRDI profile type: Publication
full work available at URL: j.ejc.2008.07.022
OpenAlex ID: W2151283714
Wikidata QID: Q56859922
cites work: Character tables of the association schemes of finite orthogonal groups acting on the nonisotropic points
cites work: On Graphs that do not Contain a Thomsen Graph
cites work: Q3907599
cites work: Q5707657
cites work: Q5520566
cites work: Graphs without quadrilaterals
cites work: On the number of edges of quadrilateral-free graphs
cites work: Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
cites work: Symmetry groups, semidefinite programs, and sums of squares
cites work: Eigenvalue bounds for independent sets
cites work: Q4370894
cites work: On the Shannon capacity of a graph
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
cites work: Graphs from projective planes
cites work: A comparison of the Delsarte and Lovász bounds
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
DOI: 10.1016/J.EJC.2008.07.022
Recommended article: Q4503943
Recommended article: Q4949778
Recommended article: The Erdős-Faber-Lovász conjecture for weakly dense hypergraphs
Recommended article: The Erdős-Faber-Lovász conjecture for dense hypergraphs
Recommended article: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Recommended article: The Lovász Number of Random Graphs
Recommended article: A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph
Recommended article: Q3424782
Recommended article: Algorithmic and explicit determination of the Lovász number for certain circulant graphs
Recommended article: Local Structure Theorems for Erdős–Rényi Graphs and Their Algorithmic Applications
description: scientific article; zbMATH DE number 5565533