arXiv (OAI)
open access
Some exact and asymptotic results for hypergraph Turán problems in $\ell_2$-norm
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
- Some exact and asymptotic results for hypergraph Turán problems in $\ell_2$-norm#183090
- Some exact and asymptotic results for hypergraph Turán problems in $\ell_2$-norm#183040
- Some exact and asymptotic results for hypergraph Turán problems in $\ell_2$-norm#182990
- An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs#1011997
- Almost norming vertices for homogeneous polynomials on the cube#1116857
Record · ID 183140
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