arXiv (All)
open access
Degree-square Turán problem for two self-converse tournaments
For a fixed digraph $F$, let $\operatorname{ex}_2^+(n,F)$ be the maximum of $\sum_{v\in V(D)}d_D^+(v)^2$ over all $n$-vertex $F$-free digraphs. Ai et al. [arXiv:2606.03520, 2026] asked for which self-converse tournament $F$ one can determine $\operatorname{ex}_2^+(n,F)$. Let $TT_r$ denote a transiti
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
- An improved bound on the treewidth of planar graphs excluding a grid minor#1109584
- Challengers Shift to Lower-Tier Competition When Elite Incumbents Extend Their Tenure: Evidence From Professional Tennis#299013
- Matroid Packing Games: The Core and the Nucleolus#1141321
- On the minimum number of triangles in balanced tripartite graphs with large minimum degree#1034400
- Long-Term Tennis Participation and Self-Efficacy in Older South Korean Male Adults: A Qualitative Study.#236247
Record · ID 1155982
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