Conceptio › Archive › arXiv (OAI Expanded)

arXiv (OAI Expanded)open access

An Exposition of the $\widetilde{O}(\log^{1/4} n)$ Bound for the Komlós Problem

Bansal, Nikhil et al.

arXiv (OAI Expanded) · Papers · License: Open Access

Open Source ↗Direct PDF ↓

combinatorics data-structures-and-algorithms discrete-mathematics probability

combinatorics, discrete mathematics, data structures and algorithms, probability

This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗

Related documents

Infinitely many size-Ramsey numbers of $k$-uniform relaxed $\ell$-trees are not polynomial#965978

Record · ID 788456
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.