arXiv (All)
open access
Interval number for tournaments in P3-convexity
We study the complexity of determining the interval numbers of tournaments in the $\overrightarrow{P_3}$ and $\overrightarrow{P_3^*}$ convexities, denoted by $\overrightarrow{\mathrm{in}}_{P_3}(T)$ and $\overrightarrow{\mathrm{in}}_{P_3^*}(T)$ on a tournament $T$. For each $\overrightarrow{\mathcal{
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
- Entropy and singularity of spectral and pivotal sets in planar percolation#1109407
- A Note on Triple Repetition Sequence of Domination Number in Graphs#722491
- Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs#344749
- Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs#344748
- Paired Disjunctive Domination Number of Middle Graphs#1012030
Record · ID 1037323
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