Positive discrepancy, MaxCut, and eigenvalues of graphs
From MaRDI portal
Cites work
- Approximately strongly regular graphs
- Bipartite subgraphs
- Cutting a graph into two dissimilar halves
- Denniston partial difference sets exist in the odd prime case
- Distance-regular graphs
- Expander graphs and their applications
- scientific article; zbMATH DE number 3884175 (Why is no real title available?)
- scientific article; zbMATH DE number 3124239 (Why is no real title available?)
- scientific article; zbMATH DE number 3715594 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3510345 (Why is no real title available?)
- scientific article; zbMATH DE number 1528185 (Why is no real title available?)
- Imbalances in k‐colorations
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Large equiangular sets of lines in euclidean space
- Lower bounds for max-cut in H-free graphs via semidefinite programming
- MaxCut in ${\bm H)$-Free Graphs
- More sets, graphs and numbers. A salute to Vera Sós and András Hajnal
- New results for MaxCut in H$H$‐free graphs
- On MaxCut and the Lov\'asz theta function
- On the Edge-Expansion of Graphs
- On the second eigenvalue of a graph
- Pseudo-random graphs
- Quadratic forms on graphs
- Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs
- Some Extremal Properties of Bipartite Subgraphs
- The difference between consecutive primes. II
- The largest eigenvalue of a graph: A survey
Cited in
(3)
This page was built for publication: Positive discrepancy, MaxCut, and eigenvalues of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858942)
