arXiv (All)
open access
$L_2$ Turán Problems for Small Tournaments and Stability
We investigate the $L_2$ Turán problems for various small directed graphs, specifically focusing on self-converse tournaments and stability versions. First, we determine the exact maximum $L_2$ norm squared of the out-degree sequence for digraphs avoiding the transitive tournament $TT_4$ and the str
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
- A proof of the maximum Laplacian energy conjecture for connected graphs via a sharp eigenvalue-sum bound#974019
- Emergent Sorting in Networks of Router Agents#622709
- Generating the symmetric group by three prefix reversals#820283
- Metrics and Methods for One-Way IP Capacity#502520
- Long Directed Cycles in Vertex-Transitive Digraphs#635896
Record · ID 971997
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