arXiv (All)
open access
Incidence Rank and Bounded Defect for Linear Hypergraphs with Cograph Line Graphs
Let $N(H)$ be the edge--vertex incidence matrix of a finite linear $s$-uniform hypergraph whose line graph is a cograph, and define \[ R_s(H)=(s+1)\operatorname{rank}_{\mathbb R}N(H)-s|E(H)|. \] The inequality $R_s(H)\ge0$ holds, with equality characterized by affine planes of order $s$ on every row
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
- Further results on \([k]\)-Roman domination on cylindrical grids \(C_m \Box P_n\)#1076842
- Large Complete Minors from a Cheeger Condition#1109429
- Sharper Zarankiewicz and Diagonal Bipartite Ramsey Bounds#1117649
- Weinstock Inequality on Regular Trees#973676
- Clique covers and decompositions of cliques of graphs#1122901
Record · ID 1064321
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