On the Shannon capacity of a graph
From MaRDI portal
Publication:4178914
DOI10.1109/TIT.1979.1055985zbMath0395.94021WikidataQ29013070 ScholiaQ29013070MaRDI QIDQ4178914
Publication date: 1979
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Petersen graphpentagonself-complementary graphShannon zero error capacityvertex transitive automorphism group
Related Items
Noncontextual coloring of orthogonality hypergraphs, On outindependent subgraphs of strongly regular graphs, Handling symmetries in mixed-integer semidefinite programs, Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank, Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods, Approximately counting independent sets in bipartite graphs via graph containers, On Sidorenko's conjecture for determinants and Gaussian Markov random fields, Filling space with hypercubes of two sizes – The pythagorean tiling in higher dimensions, Extremal Problem for Matchings and Rainbow Matchings on Direct Products, Sum of Squares Bounds for the Empty Integral Hull Problem, The core of a complementary prism, Semidefinite programming and its applications to NP problems, A Sum of Squares Characterization of Perfect Graphs, The zero-error capacity of binary channels with 2-memories, Local orthogonality dimension, A geometric approach to betweenness, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming, Unnamed Item, Approximation of the Shannon capacity via matrix cone programming, A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems, Resource convertibility and ordered commutative monoids, Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022, Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases, Hypergraph LSS-ideals and coordinate sections of symmetric tensors, Lower bound on the minimum number of edges in subgraphs of Johnson graphs, Inclusion matrices for rainbow subsets, On the complete description of entangled systems. I: Exploring hidden variables and context communication cost in simulating quantum correlations, Perfect and nearly perfect separation dimension of complete and random graphs, Quantum hypergraph homomorphisms and non-local games, Odd distances in colourings of the plane, On the Normalized Shannon Capacity of a Union, Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability, Unnamed Item, DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization, Homomorphisms of strongly regular graphs, Quadratic forms on graphs, Exclusivity structures and graph representatives of local complementation orbits, A cross-intersection theorem for vector spaces based on semidefinite programming, Linear Index Coding via Semidefinite Programming, Semidefinite programming and combinatorial optimization, Independence numbers of product graphs, Constructive lower bounds for off-diagonal Ramsey numbers, Unextendible product bases, The minimum rank problem for circulants, Estimating quantum chromatic numbers, A characterization of the weighted Lovász number based on convex quadratic programming, Semidefinite relaxations for partitioning, assignment and ordering problems, New results for recognizing convex-QP adverse graphs, Communication Lower Bounds Via the Chromatic Number, Semidefinite relaxations for partitioning, assignment and ordering problems, Extended formulations from communication protocols in output-efficient time, A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations, Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian, The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime, Unnamed Item, Cliques and colorings in generalized Paley graphs and an approach to synchronization, Linear game non-contextuality and Bell inequalities—a graph-theoretic approach, Unnamed Item, Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning, Relaxations of vertex packing, On the independence number of some strong products of cycle-powers, Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs, Conic formulations of graph homomorphisms, Linearly independent vertices and minimum semidefinite rank, A heuristic for the stability number of a graph based on convex quadratic programming and tabu search, Copositive programming motivated bounds on the stability and the chromatic numbers, A simple removal lemma for large nearly-intersecting families, Generating cutting planes for the semidefinite relaxation of quadratic programs, A boundary point method to solve semidefinite programs, A nonmonotone GRASP, New heuristics for the vertex coloring problem based on semidefinite programming, Semidefinite representations for finite varieties, Semidefinite programming relaxations for graph coloring and maximal clique problems, Strengthened semidefinite programming bounds for codes, The asymptotic behaviour of Lovasz' \(\vartheta\) function for random graphs, A characterization of Delsarte's linear programming bound as a ratio bound, Stochastic nuclear outages semidefinite relaxations, Semidefinite bounds for the stability number of a graph via sums of squares of polynomials, The independence number of the strong product of cycles, Polytopes of minimum positive semidefinite rank, Strong lift-and-project cutting planes for the stable set problem, Computing clique and chromatic number of circular-perfect graphs in polynomial time, Classical, quantum and nonsignalling resources in bipartite games, A quantitative version of Steinhaus' theorem for compact, connected, rank-one symmetric spaces, Classes of representable disjoint \textsf{NP}-pairs, On the independence numbers of the cubes of odd cycles, New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix, Computing the Grothendieck constant of some graph classes, Improving an upper bound on the size of \(k\)-regular induced subgraphs, Entanglement can increase asymptotic rates of zero-error classical communication over classical channels, Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited, Graphs associated with vector spaces of even dimension: A link with differential geometry, Copositive optimization -- recent developments and applications, Optimality theorems for convex semidefinite vector optimization problems, A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs, A new linear programming algorithm - better or worse than the simplex method?, Stability for intersecting families in \(\mathrm{PGL}(2,q)\), Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph, An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q), A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem, Perfect matchings as IID factors on non-amenable groups, On the density of sequences of integers the sum of no two of which is a square. I: Arithmetic progressions, Randomly colouring graphs (a combinatorial view), Regular inference as vertex coloring, The spherical constraint in Boolean quadratic programs, Spectral bounds for the independence ratio and the chromatic number of an operator, Forbiddance and capacity, On hypercube packings, blocking sets and a covering problem, A sequential elimination algorithm for computing bounds on the clique number of a graph, Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques, Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs, Chance constrained \(0-1\) quadratic programs using copulas, Independent sets in graphs, Four-dimensional polytopes of minimum positive semidefinite rank, On metric properties of maps between Hamming spaces and related graph homomorphisms, On Minkowski space and finite geometry, The cardinality of the collection of maximum independent sets of a functional graph, A note on fractional coloring and the integrality gap of LP for maximum weight independent set, A new property of the Lovász number and duality relations between graph parameters, Graph connectivity and universal rigidity of bar frameworks, Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs, An axiomatic duality framework for the theta body and related convex corners, The complexity of unions of disjoint sets, Laplace eigenvalues of graphs---a survey, The Sperner capacity of linear and nonlinear codes for the cyclic triangle, On the measure of intersecting families, uniqueness and stability, On cover-structure graphs, Cutting planes in integer and mixed integer programming, Quadratic factorization heuristics for copositive programming, A class of semidefinite programs with rank-one solutions, On the isoperimetric spectrum of graphs and its approximations, Improving an upper bound on the stability number of a graph, On linear and semidefinite programming relaxations for hypergraph matching, Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming, Extensions on ellipsoid bounds for quadratic integer programming, Vector representations of graphs, On the chromatic number of a simplicial complex, The minimum rank of symmetric matrices described by a graph: a survey, Block-diagonal semidefinite programming hierarchies for 0/1 programming, The Laplacian spectral radius of a graph under perturbation, Invitation to intersection problems for finite sets, Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope, On the ideal of orthogonal representations of a graph in \(\mathbb{R}^2\), Laplacian eigenvalues and partition problems in hypergraphs, On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs, On types of growth for graph-different permutations, The exact bound in the Erdős-Ko-Rado theorem, Commutative association schemes, \(L(2,1)\)-labeling of strong products of cycles, Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks, Exploiting special structure in semidefinite programming: a survey of theory and applications, Lower bounds in minimum rank problems, The strong perfect graph conjecture: 40 years of attempts, and its resolution, Lower bounds for measurable chromatic numbers, On the dimension to represent a graph by a unit distance graph, Entropy splitting for antiblocking corners and perfect graphs, Quantum graph homomorphisms via operator systems, Quantum homomorphisms, On the Shannon capacity of a directed graph, Some Erdös–Ko–Rado Theorems for Chevalley Groups, Vector representation of graph domination, Grothendieck-Type Inequalities in Combinatorial Optimization, Matrix Relaxations in Combinatorial Optimization, On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy, Completing bases in four dimensions, Classical simulation of contextuality through hiding the disturbance, Mathematical Programming Models and Exact Algorithms, TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM, Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies, Unnamed Item, Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone, A Derivation of Lovász' Theta via Augmented Lagrange Duality, Fast implementation for semidefinite programs with positive matrix completion, Spectral Bounds for the k-Regular Induced Subgraph Problem, Tight Frame Graphs Arising as Line Graphs, Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph, On Extremal Set Partitions in Cartesian Product Spaces, Lovász and Schrijver $$N_+$$-Relaxation on Web Graphs, Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem, A limit theorem for the Shannon capacities of odd cycles. II, On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs, An Analogue of the Shannon Capacity of a Graph, On the Lovász Theta Function for Independent Sets in Sparse Graphs, The Maximum k-Colorable Subgraph Problem and Related Problems, Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming, A Bound on the Shannon Capacity via a Linear Programming Variation, Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism, A recursive Lovász theta number for simplex-avoiding sets, Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms, Combining semidefinite and polyhedral relaxations for integer programs, Binary Positive Semidefinite Matrices and Associated Integer Polytopes, Graph Information Ratio, On the flip graphs on perfect matchings of complete graphs and signed reversal graphs, Unnamed Item, Linear programing relaxations for a strategic pricing problem in electricity markets, Characterizing N+-perfect line graphs, Unnamed Item, Unnamed Item, On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy, Sum of squares basis pursuit with linear and second order cone programming, Constraint and Satisfiability Reasoning for Graph Coloring, The sheaf-theoretic structure of non-locality and contextuality, Quantum Probability Aspects to Lexicographic and Strong Products of Graphs, Lovász, Vectors, Graphs and Codes, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Why Is Maximum Clique Often Easy in Practice?, A guide to conic optimisation and its applications, Unnamed Item, Topological Bounds for Graph Representations over Any Field, A New Approach to the Stable Set Problem Based on Ellipsoids, Unnamed Item, A new branch-and-bound algorithm for standard quadratic programming problems, Quantitative geometry, QUANTUM ZERO-ERROR CAPACITY, Spectral upper bound on the quantum k-independence number of a graph, Quantum nonlocality enhanced by homogenization, Unnamed Item, Unnamed Item, Approximating maximum independent sets by excluding subgraphs, Unnamed Item, A limit theorem for the Shannon capacities of odd cycles I, Unnamed Item, Dimension Reduction for Polynomials over Gaussian Space and Applications, High-accuracy solution of large-scale semidefinite programs, A robust algorithm for semidefinite programming, Gap, cosum and product properties of the θ′ bound on the clique number, Grothendieck inequalities for semidefinite programs with rank constraint, Semidefinite Programming and Constraint Programming, Computational Approaches to Max-Cut, A survey on graphs with convex quadratic stability number, Removal and Stability for Erdös--Ko--Rado, Zero-error stationary coding over stationary channels, Coloring the Voronoi tessellation of lattices, Eternal and Secure Domination in Graphs, SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0), A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem, Maximum privacy without coherence, zero-error, Hypercontractive inequalities via SOS, and the Frankl--Rödl graph, Developments in the theory of graph spectra, Lovász-Schrijver PSD-Operator on Claw-Free Graphs, A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs, Strengthening Chvátal-Gomory Cuts for the Stable Set Problem, Regularity of parity binomial edge ideals, Spectral upper bounds on the size of k-regular induced subgraphs, Some advances on Lovász-Schrijver relaxations of the fractional stable set polytope, Near-perfect graphs with polyhedral, Semidefinite Programming and Nash Equilibria in Bimatrix Games, Geometric representations of graphs, On LP-based approximation for copositive formulation of stable set problem, Shannon zero error capacity in the problems of state estimation and stabilization via noisy communication channels, On the capacity of the arbitrarily varying channel for maximum probability of error, Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite Programming, Primal–dual first-order methods for a class of cone programming, Clique, chromatic, and Lovász numbers of certain circulant graphs, Geometric representations of graphs, A “simple” rectangular puzzle, A general method to obtain the spectrum and local spectra of a graph from its regular partitions, Graph Kernels: A Survey, Fourier Analysis on Finite Groups and the Lovász ϑ-Number of Cayley Graphs, Variational analysis of the Ky Fan \(k\)-norm, New lower bounds for the Shannon capacity of odd cycles, Sperner capacities, On NP-hardness of the clique partition -- independence number gap recognition and related problems, Tightening a copositive relaxation for standard quadratic optimization problems, An orthogonal basis for functions over a slice of the Boolean hypercube, Copositivity cuts for improving SDP bounds on the clique number, Algorithmic and explicit determination of the Lovász number for certain circulant graphs, Reductions between disjoint NP-pairs, An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem, On the copositive representation of binary and continuous nonconvex quadratic programs, Optimization and operations research in mitigation of a pandemic, More on signed graphs with at most three eigenvalues, LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison, Graph coloring and semidefinite rank, Positive matching decompositions of graphs, Hoffman's ratio bound, Shannon capacity and the categorical product, On colorful edge triples in edge-colored complete graphs, The Erdős matching conjecture and concentration inequalities, Orthogonal representations of Steiner triple system incidence graphs, Generating irreducible copositive matrices using the stable set problem, Spectral operators of matrices, A comparison of integer programming models for the partial directed weighted improper coloring problem, Varieties of contextuality based on probability and structural nonembeddability, A survey on the missing Moore graph, Symmetric Shannon capacity is the independence number minus 1, Structure and supersaturation for intersecting families, Vector coloring the categorical product of graphs, Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming, Duality of graph invariants, Counting frequent patterns in large labeled graphs: a hypergraph-based approach, Approximating projections by quantum operations, Maximum \(k\)-regular induced subgraphs, A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring, Graphical designs and extremal combinatorics, A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number, Asymptotic values of the Hall-ratio for graph powers, Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs, An efficiently computable subgraph pattern support measure: counting independent observations, Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes, Orthonormal representations of \(H\)-free graphs, High dimensional Hoffman bound and applications in extremal combinatorics, On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship, On the theta number of powers of cycle graphs, Book drawings of complete bipartite graphs, Large regular bipartite graphs with median eigenvalue 1, Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope, Chromatic Gallai identities operating on Lovász number, Forbidding just one intersection, for permutations, On circular-perfect graphs: a survey, Lovász-Saks-Schrijver ideals and parity binomial edge ideals of graphs, Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem, \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM, Computing inductive vertex orderings, Quantum violation of the suppes-zanotti inequalities and ``contextuality, A semidefinite programming-based heuristic for graph coloring, Maximum values of degree-based entropies of bipartite graphs, A new graph parameter related to bounded rank positive semidefinite matrix completions, An SDP primal-dual algorithm for approximating the Lovász-theta function, A combinatorial approach to nonlocality and contextuality, Polynomial time algorithm for min-ranks of graphs with simple tree structures, Intersecting families of discrete structures are typically trivial, A projected gradient algorithm for solving the maxcut SDP relaxation, Exploiting semidefinite relaxations in constraint programming, Exploring the relationship between max-cut and stable set relaxations, Semi-Definite positive Programming Relaxations for Graph Kn-Coloring in Frequency Assignment, Applications of Ramsey theory, Sylow subgraphs in self-complementary vertex transitive graphs, A Comprehensive Analysis of Polyhedral Lift-and-Project Methods, Matrix convex hulls of free semialgebraic sets, On extracting maximum stable sets in perfect graphs using Lovász's theta function, Exponential Lower Bounds for Polytopes in Combinatorial Optimization, Computing the clique number of \(a\)-perfect graphs in polynomial time, Convex Hulls of Algebraic Sets, Convex Relaxations and Integrality Gaps, Relaxations of Combinatorial Problems Via Association Schemes, Invariant Semidefinite Programs, Projection Methods in Conic Optimization, Some observations on the smallest adjacency eigenvalue of a graph, The minrank of random graphs over arbitrary fields, Divergent permutations, The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum, Semidefinite programming bounds for Lee codes, Analytical properties of Shannon's capacity of arbitrarily varying channels under list decoding: super-additivity and discontinuity behavior, Lower bounds for the measurable chromatic number of the hyperbolic plane, On the \(k\)-independence number of graphs, The theta number of simplicial complexes, Topological bounds on the dimension of orthogonal representations of graphs, Spectral lower bounds for the orthogonal and projective ranks of a graph, Orthogonal representations over finite fields and the chromatic number of graphs, Local chromatic number and Sperner capacity, On upper bounding Shannon capacity of graph through generalized conic programming, Chromatic numbers, Sabidussi's theorem and Hedetniemi's conjecture for non-commutative graphs, Lovász theta type norms and operator systems, Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition, Completely positive reformulations for polynomial optimization, The density of sets avoiding distance 1 in Euclidean space, On the number of union-free families, On the bandwidth of the Kneser graph, Subgraph complementation and minimum rank, The \(k\)-fractal of a simplicial complex, Different capacities of a digraph, Capacities: From information theory to extremal set theory, Algebras, graphs and thetas, On standard quadratic programs with exact and inexact doubly nonnegative relaxations, Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming, On the subspace choosability in graphs, Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials, On the ultimate independence ratio of a graph, Graph theory -- a survey on the occasion of the Abel Prize for László Lovász, Book review of: L. Lovász, Graphs and geometry, The geometry of graphs and some of its algorithmic applications, Interlacing eigenvalues and graphs, Motivations and history of some of my conjectures, Eigenvalues, eigenspaces and distances to subsets, Information theoretic parameters of noncommutative graphs and convex corners, Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization, On coverings of tori with cubes, Faithful orthogonal representations of graphs from partition logics, A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming, Semidefinite programming in combinatorial optimization, On the ultimate normalized chromatic difference sequence of a graph, On product of association schemes and Shannon capacity, Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function, A semidefinite approach to the $K_i$-cover problem, An upper bound on the independence number of a graph computable in polynomial-time, Diversification strategies in tabu search algorithms for the maximum clique problem, Approximating the independence number via the \(\vartheta\)-function, Dot product representations of graphs, On the bounds for the ultimate independence ratio of a graph, Sabidussi versus Hedetniemi for three variations of the chromatic number, Solving \(k\)-cluster problems to optimality with semidefinite programming, A semidefinite programming approach to a cross-intersection problem with measures, On reducibility and symmetry of disjoint NP pairs., The maximum edge biclique problem is NP-complete, On the Shannon capacity of triangular graphs, New lower bound on the Shannon capacity of \(C_7\) from circular graphs, Control and estimation under information constraints: toward a unified theory of control, computation and communications, Best ellipsoidal relaxation to solve a nonconvex problem., Laplacian eigenvalues and fixed size multisection, On the rank of a matrix associated with a graph., The ellipsoid method and its consequences in combinatorial optimization, Triangle free graphs that are not \(\sqrt{3}\)-embeddable in \(S^ n\)., Beyond the Erdős-Ko-Rado theorem, Independence number of products of Kneser graphs, A note on vector representation of graphs, Notes on computational-to-statistical gaps: predictions using statistical physics, Multipartite composition of contextuality scenarios, The symbiotic relationship of combinatorics and matrix theory, A domain monotonicity theorem for graphs and Hamiltonicity, Quantum privacy and Schur product channels, A combinatorial approach to complexity, Random Laplacian matrices and convex relaxations, Optimization over structured subsets of positive semidefinite matrices via column generation, On the Lovász theta function and some variants, Qualitative independence and Sperner problems for directed graphs, Dual estimates in multiextremal problems, Sandwich theorems and capacity bounds for non-commutative graphs, Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring, An improved semidefinite programming relaxation for the satisfiability problem, A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation, The \(k\)-regular induced subgraph problem, An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs, The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters, Partitioning transitive tournaments into isomorphic digraphs, Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion, On the arithmetic mean of the size of cross-union families, On the capacity of Boolean graph formulæ, Tensor theta norms and low rank recovery, A unified construction of semiring-homomorphic graph invariants, On the N-spectrum of oriented graphs, Matchings and covers in hypergraphs, The gap between monotone and non-monotone circuit complexity is exponential, Generalized Greenberger-Horne-Zeilinger arguments from quantum logical analysis, Probabilistic refinement of the asymptotic spectrum of graphs, Optimization of eigenvalue bounds for the independence and chromatic number of graph powers, Orthogonal representations and connectivity of graphs, Modified \(r\)-algorithm to find the global minimum of polynomial functions, Geometrical embeddings of graphs, Role of redundant constraints for improving dual bounds in polynomial optimization problems, On zero-error codes produced by greedy algorithms, Lovász theta approach to eventown problem, Worst-case analysis of clique MIPs, Eigenvalue interlacing and weight parameters of graphs, Improved lower bound on the Shannon capacity of \(C_7\), Bicliques and eigenvalues, Dynamic node packing, Spectral characterizations of the Lovász number and the Delsarte number of a graph, Dual bounds for the positive definite functions approach to mutually unbiased bases, Stable sets and polynomials, Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem, More tales of Hoffman: bounds for the vector chromatic number of a graph, An exponential gap with the removal of one negation gate, Heuristics for semirandom graph problems, The maximum clique problem, On the Shannon capacity of sums and products of graphs, Spectrum of Johnson graphs, Laplacian matrices of graphs: A survey, Complete positivity and distance-avoiding sets