On the Lovász -number of almost regular graphs with application to Erdős-Rényi graphs
DOI10.1016/J.EJC.2008.07.022zbMATH Open1200.05163OpenAlexW2151283714WikidataQ56859922 ScholiaQ56859922MaRDI QIDQ1024280FDOQ1024280
Authors: Mike Newman, E. de Klerk, Dmitrii V. Pasechnik, Renata Sotirov 
Publication date: 17 June 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2008.07.022
Recommendations
- scientific article; zbMATH DE number 1507223
- scientific article; zbMATH DE number 1439404
- The Erdős-Faber-Lovász conjecture for weakly dense hypergraphs
- The Erdős-Faber-Lovász conjecture for dense hypergraphs
- The Lovász number of random graphs
- The Lovász Number of Random Graphs
- A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph
- scientific article; zbMATH DE number 5130735
- Algorithmic and explicit determination of the Lovász number for certain circulant graphs
- Local structure theorems for Erdős-Rényi graphs and their algorithmic applications
Programming involving graphs or networks (90C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Title not available (Why is that?)
- On the Shannon capacity of a graph
- Title not available (Why is that?)
- Eigenvalue bounds for independent sets
- Symmetry groups, semidefinite programs, and sums of squares
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Title not available (Why is that?)
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- On Graphs that do not Contain a Thomsen Graph
- Title not available (Why is that?)
- A comparison of the Delsarte and Lovász bounds
- Graphs without quadrilaterals
- On the number of edges of quadrilateral-free graphs
- On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
- Graphs from projective planes
- Character tables of the association schemes of finite orthogonal groups acting on the nonisotropic points
Cited In (8)
- A relative bound for independence
- Title not available (Why is that?)
- On the chromatic number of the Erdős-Rényi orthogonal polarity graph
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software
- The independence number for polarity graphs of even order planes
- The asymptotic behaviour of Lovasz' \(\vartheta\) function for random graphs
- Invariant Semidefinite Programs
Uses Software
This page was built for publication: On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024280)
