Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.19068 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- We prove that for any linear 3-graph on $n$ vertices without a path of length 5, the number of edges is at most $\frac{15}{11}n$, and the equality holds if and only if the graph is the disjoint union of $G_0$, a graph with 11 vertices and 15 edges. Thus, $ex_L(n,P_5)\leq \frac{15}{11}n$, and the equality holds if and only if $11|n$.