arXiv (All)
open access
The maximum spectral radius of outerplanar and planar $k$-uniform hypergraphs
For an integer $k\ge3$, a $k$-angulation is a simple $2$-connected outerplane graph whose interior faces are bounded by $k$-cycles, and a closed $k$-angulation is a simple $2$-connected plane graph all of whose faces, the outer face included, are bounded by $k$-cycles; the face hypergraph of either
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
- On the maximum number of triangles in tripartite graphs with no $4$-cycles between any two parts#974703
- A linear bound for nested cycles without geometric crossings#985258
- Optical design of VIPER: a high-resolution multimode fiber-fed VIPA spectrograph for characterizing exoplanet atmospheric escape#926979
- Bipartite Graphs Are Not Well-Quasi-Ordered by Bipartite Minors#1116198
- A Slotted ALOHA Scheme Based on Bipartite Graph Optimization#408434
Record · ID 997656
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