Pages that link to "Item:Q933677"

The following pages link to Eigenvalue bounds for independent sets (Q933677):

Displaying 40 items.

• An Erdős-Ko-Rado theorem for finite classical polar spaces (Q256539) (← links)
• A note on Erdős-Ko-Rado sets of generators in Hermitian polar spaces (Q326333) (← links)
• Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs (Q329557) (← links)
• The independence number for polarity graphs of even order planes (Q356737) (← links)
• Constructing uniquely realizable graphs (Q393739) (← links)
• A recursive construction of the regular exceptional graphs with least eigenvalue \(-2\) (Q399386) (← links)
• A note on eigenvalue bounds for independence numbers of non-regular graphs (Q400541) (← links)
• Independent sets in graphs (Q501998) (← links)
• A simpler characterization of a spectral lower bound on the clique number (Q966428) (← links)
• The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph (Q979013) (← links)
• Spectral upper bounds for the order of a \(k\)-regular induced subgraph (Q984870) (← links)
• On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs (Q1024280) (← links)
• More spectral bounds on the clique and independence numbers (Q1044204) (← links)
• Triangle-free induced subgraphs of the unitary polarity graph (Q1645061) (← links)
• The least eigenvalue of a graph with a given domination number (Q1758470) (← links)
• The \(k\)-regular induced subgraph problem (Q1786867) (← links)
• Cameron-Liebler sets of \(k\)-spaces in \(\mathrm{PG}(n,q)\) (Q1999902) (← links)
• Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs (Q2075522) (← links)
• The maximum spectral radius of non-bipartite graphs forbidding short odd cycles (Q2094864) (← links)
• The product of two high-frequency graph Laplacian eigenfunctions is smooth (Q2111909) (← links)
• Toughness and normalized Laplacian eigenvalues of graphs (Q2139788) (← links)
• A relative bound for independence (Q2329192) (← links)
• On the chromatic number of the Erdős-Rényi orthogonal polarity graph (Q2344823) (← links)
• A new eigenvalue bound for independent sets (Q2346340) (← links)
• Theorems of Erdős-Ko-Rado type in geometrical settings (Q2438531) (← links)
• On a conjecture of Erdős and Simonovits: even cycles (Q2439838) (← links)
• Laplacian spectral bounds for clique and independence numbers of graphs (Q2642010) (← links)
• Hoffman's ratio bound (Q2656649) (← links)
• Dimension-free bounds and structural results in communication complexity (Q2698435) (← links)
• Graph toughness from Laplacian eigenvalues (Q2700326) (← links)
• Orthogonal Polarity Graphs and Sidon Sets (Q2811198) (← links)
• Cops and Robbers on Graphs Based on Designs (Q2864796) (← links)
• Spectral Bounds for the k-Regular Induced Subgraph Problem (Q4554522) (← links)
• Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite Programming (Q5013579) (← links)
• Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software (Q5058403) (← links)
• On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
• The power of small coalitions under two-tier majority on regular graphs (Q6048435) (← links)
• Approximately counting independent sets in bipartite graphs via graph containers (Q6074723) (← links)
• Spectral bounds for the vulnerability parameters of graphs (Q6125428) (← links)
• On the independence number of regular graphs of matrix rings (Q6184915) (← links)