Pages that link to "Item:Q790829"

The following pages link to Lower bounds for the clique and the chromatic numbers of a graph (Q790829):

Displaying 36 items.

• Conjectured bounds for the sum of squares of positive eigenvalues of a graph (Q297913) (← links)
• New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix (Q396873) (← links)
• Some eigenvalue properties in graphs (conjectures of Graffiti -- II) (Q686466) (← links)
• Walks and the spectral radius of graphs (Q852649) (← links)
• Spectral radii of graphs with given chromatic number (Q868006) (← links)
• A survey of automated conjectures in spectral graph theory (Q962119) (← links)
• More spectral bounds on the clique and independence numbers (Q1044204) (← links)
• Reverse binary graphs (Q1310229) (← links)
• The maximum clique problem (Q1318271) (← links)
• On completely positive graphs and their complements (Q1406281) (← links)
• Exact bounds on the order of the maximum clique of a graph. (Q1811073) (← links)
• Computers and discovery in algebraic graph theory (Q1855400) (← links)
• Eigenvalues and chromatic number of a signed graph (Q2020660) (← links)
• Measure-theoretic bounds on the spectral radius of graphs from walks (Q2032249) (← links)
• Ordering graphs with given size by their signless Laplacian spectral radii (Q2082377) (← links)
• Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size (Q2166257) (← links)
• A note on eigenvalues of signed graphs (Q2168916) (← links)
• The signless Laplacian spectral radius of graphs with a prescribed number of edges (Q2197131) (← links)
• A spectral version of Mantel's theorem (Q2237213) (← links)
• Analytic methods for uniform hypergraphs (Q2250784) (← links)
• Turán's theorem implies Stanley's bound (Q2296007) (← links)
• The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs (Q2347469) (← links)
• Partitions of graphs into small and large sets (Q2446835) (← links)
• A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size (Q2668072) (← links)
• Signed spectral Turań-type theorems (Q2685382) (← links)
• Counting substructures and eigenvalues. I: Triangles (Q2700994) (← links)
• Clique, chromatic, and Lovász numbers of certain circulant graphs (Q3439129) (← links)
• The largest eigenvalue of a graph: A survey (Q4713877) (← links)
• Eigenvalues and triangles in graphs (Q4993261) (← links)
• Chromatic number and signless Laplacian spectral radius of graphs (Q5104011) (← links)
• Distance Laplacian eigenvalues and chromatic number in graphs (Q5157458) (← links)
• New analytical lower bounds on the clique number of a graph (Q5268926) (← links)
• Two conjectured strengthenings of Turán's theorem (Q6141065) (← links)
• Remarks on the largest eigenvalue of a signed graph (Q6166492) (← links)
• A Brualdi-Hoffman-Turán problem on cycles (Q6568842) (← links)
• A refined Turán theorem (Q6571557) (← links)