zbMATH Open
metadata only
On the maximum number of cyclic triples in oriented graphs
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
- Circular Chromatic Numbers, Signability, Relation Algebras, and Network Satisfaction Problems#924484
- Circular Chromatic Numbers, Signability, Relation Algebras, and Network Satisfaction Problems#920253
- Optimally pseudorandom $K_4$-free graphs#1116792
- On asymptotic packing of geometric graphs#1039005
- Graph theory: From Euler to modern application#701384
Record · ID 490169
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