arXiv (All)
open access
Note on near-spanning balanced antidirected trees missing from regular tournaments
We construct near-spanning balanced antidirected trees that fail to embed in highly symmetric tournaments despite the conjectured semidegree condition being satisfied. More precisely, for every sufficiently large odd integer $n$, we exhibit a regular vertex-transitive tournament on $n$ vertices and
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
- The Remaining $K_4$-Free Case in the Multipartite Clique Problem#1013778
- Minimum-excess coverings of complete graphs by 3-, 4-, and 5-cliques#1142646
- The Borowiecki-Broere Generalized Total Coloring Conjecture for Planar Graphs#1154714
- Block-Transitive $5$-$(v,k,2)$ Designs with $k$ divides $v$#1131814
- Bargaining solutions for biobjective combinatorial optimization and applications to some graph covering problems#155963
Record · ID 1186704
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