arXiv (All)
open access
Cyclic Incidence Orderings of Complete Graphs and 3-Uniform Hypergraphs
We study cyclic orderings of all edges of a complete $k$-uniform hypergraph on $n$ vertices in which the binary incidence sequences of the vertices are cyclic shifts of a common word. The shifts are chosen independently, with no prescribed action on the vertices. For $2\leq k<n$, coprimality $\gcd(n
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
- Improved bounds for the lazy cops and robbers on generalized hypercubes#927470
- An Improved Upper Bound on the Threshold Bias of the Oriented-cycle Game#1013408
- Large Planar Point Sets Contain 4 Collinear Points or Almost 7-Cliques, and Related Results#1062998
- Counting almost independent sets in regular graphs#1076184
- Sparse chromatic graphs and the complete-graph triangle bound#1062147
Record · ID 974819
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