arXiv (All)
open access
Clique Number of Tournaments II
The directed clique number $\vecω(T)$ of a tournament $T$ is the minimum, over all orderings of the vertices of $T$, of the clique number of the graph whose edges are the arcs that point backward with respect to the ordering. In this paper, we prove that, for every integer $k \geq 3$, deciding wheth
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 Spanning Trees in Product Grid Graphs#1117479
- Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics#66909
- On the representation number of chessboard graphs#1036994
- A Network Formation Game for Katz Centrality Maximization: A Resource Allocation Perspective#1048320
- Strategic Centrality and the Emergence of Core-Periphery Networks#924246
Record · ID 984399
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