Metraipolis › archive › dc_371355cd454b
Linear Tur'an Numbers of Four-Edge Uniform Paths via Incidence Rank — arXiv:2609.20173
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.20173
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T04:47:09.871Z
- SHA-256 of the archived text
8ae6945f43fe3404d716798103f49acc39b166417124ef2393d15a4c68034988- Stable URL of this page
https://metraipolis.com/documento/dc_371355cd454b
How to cite
Linear Tur'an Numbers of Four-Edge Uniform Paths via Incidence Rank — arXiv:2609.20173 — arXiv (en), https://arxiv.org/abs/2609.20173 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_371355cd454b (Metraipolis archive dc_371355cd454b, sha256 8ae6945f43fe3404d716798103f49acc39b166417124ef2393d15a4c68034988)
BibTeX
@misc{dc371355cd454b,
title = {Linear Tur'an Numbers of Four-Edge Uniform Paths via Incidence Rank — arXiv:2609.20173},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.20173},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_371355cd454b; sha256 8ae6945f43fe3404d716798103f49acc39b166417124ef2393d15a4c68034988},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20173. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $P_4^r$ denote the $r$-uniform expansion of the graph path with four edges. We prove that every $n$-vertex linear $r$-uniform $P_4^r$-free hypergraph has at most $(r+1)n/r$ edges, resolving a conjecture of Adak and Verma for every $r \geq 2$. Equality holds precisely for vertex-disjoint unions of Steiner systems $S(2,r,r^2)$. The main ingredient is a sharp incidence-rank inequality. If $N(H)$ is the edge-vertex incidence matrix of a linear $r$-uniform hypergraph whose line graph is a cograph, then $(r+1)\operatorname{rank}_{\mathbb{R}} N(H) \geq r|E(H)|$. Equality holds exactly when every edge-containing component is an $S(2,r,r^2)$. The proof follows the union-join decomposition of cographs. At a join node, the row-difference spaces of the co-components are mutually orthogonal, and the possible rank defect is determined by balanced co-components. Perron-Frobenius theory identifies the smallest balanced pieces as parallel classes of $r$ disjoint $r$-sets, while an orthogonality argument bounds their number by $r+1$. The equality case then reconstructs the Steiner system. The linear Turán bound follows from $\operatorname{rank}_{\mathbb{R}} N(H) \leq |V(H)|$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.20173 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T04:15:33.137Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).