Pages that link to "Item:Q1811073"
From MaRDI portal
The following pages link to Exact bounds on the order of the maximum clique of a graph. (Q1811073):
Displayed 19 items.
- On graph-Lagrangians of hypergraphs containing dense subgraphs (Q467466) (← links)
- On the largest graph-Lagrangian of 3-graphs with fixed number of edges (Q467468) (← links)
- On Lagrangians of \(r\)-uniform hypergraphs (Q498456) (← links)
- A convex relaxation bound for subgraph isomorphism (Q666533) (← links)
- A simpler characterization of a spectral lower bound on the clique number (Q966428) (← links)
- A generalization of the Motzkin-Straus theorem to hypergraphs (Q1024737) (← links)
- Annealed replication: A new heuristic for the maximum clique problem (Q1613385) (← links)
- Maximum cliques of hypergraphs and polynomial optimization (Q1617049) (← links)
- A continuous characterization of the maximum vertex-weighted clique in hypergraphs (Q1752628) (← links)
- On the maxima of Motzkin-Straus programs and cliques of graphs (Q2089888) (← links)
- A Motzkin-Straus type result for 3-uniform hypergraphs (Q2376079) (← links)
- On Motzkin-Straus type results for non-uniform hypergraphs (Q2410100) (← links)
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
- A spinorial formulation of the maximum clique problem of a graph (Q3441737) (← links)
- (Q4968665) (← links)
- New analytical lower bounds on the clique number of a graph (Q5268926) (← links)
- Some Motzkin-Straus type results for non-uniform hypergraphs (Q5963619) (← links)
- Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs (Q5963658) (← links)
- Solving larger maximum clique problems using parallel quantum annealing (Q6098277) (← links)