Exact bounds on the order of the maximum clique of a graph.
From MaRDI portal
Publication:1811073
DOI10.1016/S0166-218X(02)00386-4zbMATH Open1051.68112MaRDI QIDQ1811073FDOQ1811073
Authors: Marco Budinich 
Publication date: 10 June 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Matrix Analysis
- Title not available (Why is that?)
- The maximum clique problem
- Title not available (Why is that?)
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Evolution towards the maximum clique
- Continuous Characterizations of the Maximum Clique Problem
- A bound on the spectral radius of graphs
- The sandwich theorem
- Title not available (Why is that?)
- Lower bounds for the clique and the chromatic numbers of a graph
- Title not available (Why is that?)
- Spectral bounds for the clique and independence numbers of graphs
- The Eigenvalues of a Graph and Its Chromatic Number
- Upper Bounds on the Order of a Clique of a Graph
- A global optimization approach for solving the maximum clique problem
- Bounds for the maximal characteristic root of a non-negative irreducible matrix
Cited In (21)
- Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
- Some Motzkin-Straus type results for non-uniform hypergraphs
- Solving larger maximum clique problems using parallel quantum annealing
- A simpler characterization of a spectral lower bound on the clique number
- On graph-Lagrangians of hypergraphs containing dense subgraphs
- Improving upper bounds for the clique number by non-valid inequalities
- On Lagrangians of \(r\)-uniform hypergraphs
- Maximum cliques of hypergraphs and polynomial optimization
- A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs
- A generalization of the Motzkin-Straus theorem to hypergraphs
- On the largest graph-Lagrangian of 3-graphs with fixed number of edges
- On cliques and Lagrangians of hypergraphs
- A Motzkin-Straus type result for 3-uniform hypergraphs
- New analytical lower bounds on the clique number of a graph
- A continuous characterization of the maximum vertex-weighted clique in hypergraphs
- On Motzkin-Straus type results for non-uniform hypergraphs
- Annealed replication: A new heuristic for the maximum clique problem
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
- On the maxima of Motzkin-Straus programs and cliques of graphs
- A convex relaxation bound for subgraph isomorphism
- A spinorial formulation of the maximum clique problem of a graph
Uses Software
This page was built for publication: Exact bounds on the order of the maximum clique of a graph.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1811073)
