The following pages link to ``Integer-making'' theorems (Q1158443):
Displaying 19 items.
- (Q5090499) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- On the discrepancy of random matrices with many columns (Q5120742) (← links)
- The set splittability problem (Q5206923) (← links)
- On Expressing Majority as a Majority of Majorities (Q5220471) (← links)
- Algorithmic Aspects of Combinatorial Discrepancy (Q5264196) (← links)
- An Improvement of the Beck–Fiala Theorem (Q5366896) (← links)
- (Q5743405) (← links)
- A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension (Q5743609) (← links)
- Irregular subgraphs (Q5885195) (← links)
- The Phase Transition of Discrepancy in Random Hypergraphs (Q6046817) (← links)
- The discrepancy of random rectangular matrices (Q6074695) (← links)
- Vector balancing in Lebesgue spaces (Q6074880) (← links)
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius (Q6156027) (← links)
- Discrepancy theory and related algorithms (Q6200209) (← links)
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)
- Discrepancy and sparsity (Q6615750) (← links)
- Burning Hamming graphs (Q6632150) (← links)
- Balancing Covariates in Randomized Experiments with the Gram–Schmidt Walk Design (Q6651399) (← links)
