arXiv (All)
open access
Maximizing $K_r + I_r$ in graphs with fixed edge density
For every integer $r\ge4$, and $ρ\in [0,1]$, we asymptotically determine the maximum proportion of $r$-element sets of vertices that induce either a clique or an independent set in a large graph with density $ρ$. This generalizes a result of Olpp for $r=3$. After the initial idea for the main proo
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
- Extremal hypergraphs without generalized 4-cycles#1142055
- $c$-Packedness versus $λ$-Low-Density in Geometric Graphs: Theory and Practice#1063442
- The Minimum-Weight Mixed Dominating Set on Threshold Graphs#924639
- Approximation Algorithms for Perfect Fair-Triangle Packing#652430
- Approximation Algorithms for Perfect Fair-Triangle Packing#650977
Record · ID 985570
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