The inertia bound is far from tight
From MaRDI portal
Publication:6634558
DOI10.1112/BLMS.13127MaRDI QIDQ6634558
Publication date: 7 November 2024
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantum homomorphisms
- Spectra of graphs
- The exact bound in the Erdős-Ko-Rado theorem
- The early evolution of the \(H\)-free process
- Problems and results in combinatorial analysis and graph theory
- On the combinatorial problems which I would most like to see solved
- Graphs from projective planes
- Large equiangular sets of lines in euclidean space
- A graph for which the inertia bound is not tight
- The sensitivity conjecture, induced subgraphs of cubes, and Clifford algebras
- On subsets of the hypercube with prescribed Hamming distances
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
- The DAD theorem for symmetric non-negative matrices
- Weighted matrix eigenvalue bounds on the independence number of a graph
- Bounding Probability of Small Deviation: A Fourth Moment Approach
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Lovász, Vectors, Graphs and Codes
- Erdős–Ko–Rado Theorems: Algebraic Approaches
- A comparison of the Delsarte and Lovász bounds
- On the Shannon capacity of a graph
- Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem
- Algorithms with large domination ratio
- Spectral upper bound on the quantum k-independence number of a graph
- Unitary signings and induced subgraphs of Cayley graphs of $\mathbb{Z}_2^{n}$
- Graphs and Geometry
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
- Bounds on a distribution function that are functions of moments to order four
- The chromatic number of random graphs
- Induced subgraphs of product graphs and a generalization of Huang's theorem
- Connections between graphs and matrix spaces
This page was built for publication: The inertia bound is far from tight
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6634558)