arXiv (All)
open access
A Direct Proof of the Locally Dense Graphon Inequality
Bradač, Sudakov, and Wigderson characterized $p$-locally dense graphons by a quadratic inequality for all bounded nonnegative functions. Their proof uses Reiher's finite lemma and graphon approximation, and they asked for a direct proof. We give one by rounding simple functions. Divide each level se
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
- Beyond Sendov's conjecture: the quadratic Tang--Zhang inequality#1013331
- A positive solution to the $L^p$ projection centroid conjecture#1052172
- Localization of the Caro-Wei bound and its applications to bipartiteness#819673
- Localization of the Caro-Wei bound and its applications to bipartiteness#809677
- Sudakov minoration for weighted Orlicz balls#1014954
Record · ID 1013225
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