Pages that link to "Item:Q5268926"
From MaRDI portal
The following pages link to New analytical lower bounds on the clique number of a graph (Q5268926):
Displaying 6 items.
- Lower bounds on paraclique density (Q266841) (← links)
- A simpler characterization of a spectral lower bound on the clique number (Q966428) (← links)
- Exact bounds on the order of the maximum clique of a graph. (Q1811073) (← links)
- Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
- Improving upper bounds for the clique number by non-valid inequalities (Q2340341) (← links)
- A new proof of the Fisher-Ryan bounds for the number of cliques of a graph (Q2716676) (← links)