Minimum graded discrepancy of graphs
From MaRDI portal
Cites work
- Bisection width, discrepancy, and eigenvalues of hypergraphs
- Cutting a graph into two dissimilar halves
- Discrepancy in graphs and hypergraphs
- Discrepancy of random graphs and hypergraphs
- Geometric discrepancy. An illustrated guide
- scientific article; zbMATH DE number 3823797 (Why is no real title available?)
- scientific article; zbMATH DE number 1528185 (Why is no real title available?)
- scientific article; zbMATH DE number 863495 (Why is no real title available?)
- Imbalances in k‐colorations
- Intersections of graphs
- Intersections of hypergraphs
- Intersections of random hypergraphs and tournaments
- Positive discrepancy, MaxCut, and eigenvalues of graphs
- Problems and results on judicious partitions
- The difference between consecutive primes. II
- The wonderful Walecki construction
This page was built for publication: Minimum graded discrepancy of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7446359)