arXiv (All)
open access
The maximum spectral radius of uniform hypergraphs whose shadow excludes a complete or complete bipartite minor
For a $k$-uniform hypergraph $\mathcal H$, the shadow of $\mathcal H$ is the graph whose edges are the pairs covered by a hyperedge. In this paper, for all sufficiently large $n$, we determine the $n$-vertex $k$-uniform hypergraphs of maximum adjacency-tensor spectral radius whose shadow has no $K_t
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
- Uniform Hypergraphs with $α$-Spectral Radius at Most That of a Loose Cycle#1050210
- Sharp spectral lower bounds for the booksize of a graph#1033994
- Connected graphs with minimum adjacency spectral gap#1142083
- On the saturation number of the kite graph#620489
- On the saturation number of the kite graph#618810
Record · ID 1037053
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