A spectral bound on hypergraph discrepancy
From MaRDI portal
Cites work
- ``Integer-making theorems
- A Fourier-analytic approach for the discrepancy of random set systems
- A note on the Beck-Fiala theorem
- An improvement of the Beck-Fiala theorem
- Coloring the projective plane
- Concentration Inequalities and Martingale Inequalities: A Survey
- Constructive algorithms for discrepancy minimization
- Constructive discrepancy minimization by walking on the edges
- Constructive Discrepancy Minimization for Convex Sets
- Deterministic discrepancy minimization via the multiplicative weight update method
- Geometric discrepancy. An illustrated guide
- scientific article; zbMATH DE number 1528185 (Why is no real title available?)
- On the discrepancy of random low degree set systems
- Optimal Construction of Edge-Disjoint Paths in Random Graphs
- Probabilistic existence of rigid combinatorial structures
- Roth's estimate of the discrepancy of integer sequences is nearly sharp
- Six Standard Deviations Suffice
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Tight upper bounds for the discrepancy of half-spaces
This page was built for publication: A spectral bound on hypergraph discrepancy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842478)
