arXiv (All)
open access
A Proof of the Erdős Matching Conjecture for Large Matchings via Sharp Tail Probability for Sums of i.i.d. Nonnegative Random Variables
We resolve a conjecture of Łuczak, Mieczkowska and Šileikis on the maximal tail probability of sums of independent and identically distributed nonnegative random variables. Specifically, for every integer $k\ge1$ and every $0\le x\le1/k$, we prove \[ \sup_{\mathbb E X_1\le x}\mathbb{P}(X_1+\cdot
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Sharp Cramér-type moderate deviation bounds for the self-normalized maximum of partial sums#1357630
- A proof system for upper and lower bounds in Probabilistic GKAT#427425
- Sharp Tail Bounds Beyond Twice the Mean#1036755
- An Erd\H os Rényi Law for the Longest Consecutive Monotone Block in a Random Permutation#1035405
- Greedy Uniformity on Trees: Exact Obstruction and Near-Uniform Spiders#1186590
Record · ID 1327793
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive