arXiv (All)open access
A $(\log n)^{1/4}$ Bound for the Komlós Problem
combinatorics, discrete mathematics, data structures and algorithms, 05d40 (primary), 11k38 (secondary)
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 986510
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.