arXiv (All)
open access
Exact extremizers for $\ell_p$-judicious bisections of triangle-free graphs
Balogh, Clemen and Lidický asked how large the minimum $\ell_p$-norm of the internal-edge counts over balanced partitions of an $n$-vertex triangle-free graph can be. For each fixed $2<p<\infty$ and all sufficiently large even $n$, we determine this value exactly for bisections and characterize all
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
- Local large deviations for triangles in sparse random graphs#1036279
- Extremal Families for the Erdős--Kleitman Problem: The Missing Constructions#800116
- Improved exponent bounds for Erdős--Selfridge curves#1142373
- The exact Erdős-Ko-Rado Theorem for 3-wise $t$-intersecting uniform families#1403050
- Computing theoretical bounds for online problems and application to bin stretching#624778
Record · ID 1401093
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