4-Edge r-Uniform Hypertrees

• 4-edge hypertrees are connected, acyclic r-uniform hypergraphs where any two distinct edges intersect in at most one vertex, manifesting as path, rooted-star-extension, and crown configurations.
• They exhibit distinct extremal bounds, with forbidden configurations like B4^r limiting edge densities and conditions for P4^r tied to Steiner systems ensuring optimal structures.
• Enumeration formulas for labelled 4-edge hypertrees integrate factorial and combinatorial methods, linking structural insights to precise Turán-type results and encoding complexities.

A hypertree is a connected, acyclic hypergraph, generalizing the classical notion of a tree from graph theory to the uniform hypergraph setting. This article addresses $r$-uniform linear hypertrees with exactly four edges, with emphasis on forbidden configurations, Turán-type extremal bounds, enumeration, and structural characterizations.

1. Definitions of 4-Edge Linear $r$-Uniform Hypertrees

For $r \ge 3$, a linear $r$-uniform hypergraph is one in which any two distinct hyperedges intersect in at most one vertex. Among all possible hypertrees with four edges, three non-isomorphic configurations are fundamental:

• Path $P_4^r$: Edges $e_1,e_2,e_3,e_4$ satisfy $|e_i|=r$; consecutive edges intersect in a unique vertex, i.e., $e_i\cap e_{i+1}=\{v_{i+1}\}$ for $i=1,2,3$, and non-consecutive edges are disjoint ($e_i\cap e_j=\emptyset$ for $r$0).
• Rooted-star-extension $r$1: Begin with a 3-edge $r$2-uniform star $r$3 with center $r$4. Three edges, $r$5, where each $r$6 is an $r$7-set, are formed; select a leaf $r$8 and append $r$9 with $r \ge 3$0 a disjoint set of $r \ge 3$1 vertices.
• Crown $r \ge 3$2: Three petals $r \ge 3$3 are mutually disjoint. The fourth edge $r \ge 3$4 (base) meets each petal in a single distinct vertex, so that $r \ge 3$5 for $r \ge 3$6.

These incidence structures classify the minimal forbidden patterns relevant for extremal and enumerative investigations (Adak et al., 24 Jan 2026).

2. Extremal Bounds for Linear Turán Numbers

The linear Turán number $r \ge 3$7 is defined as the largest possible number of edges in an $r \ge 3$8-uniform linear hypergraph on $r \ge 3$9 vertices excluding subhypergraphs isomorphic to any member of a forbidden family $r$0.

For 4-edge hypertrees, the principal results are:

Forbidden Hypertree	Bound on $r$1	Structure Achieving Equality (when possible)
$r$2	$r$3	Disjoint unions of $r$4 when $r$5
$r$6	$r$7	Requires detailed analysis; no tight construction
$r$8	$r$9	Lower bound by Steiner systems; conjectured tight

$P_4^r$0: $P_4^r$1

The root-star-extension $P_4^r$2 is prohibitive for higher edge densities, while the crown configuration tolerates sparser extremals. For $P_4^r$3, lower and conjectured upper bounds coincide but the precise equality case is unresolved (Adak et al., 24 Jan 2026).

3. Extremal Constructions and Characterization via Steiner Systems

A Steiner system $P_4^r$4 is a linear $P_4^r$5-uniform hypergraph over $P_4^r$6 vertices such that each pair lies in exactly one hyperedge, yielding $P_4^r$7 edges and each vertex degree $P_4^r$8.

For $P_4^r$9:

• Under the existence of $e_1,e_2,e_3,e_4$0 and $e_1,e_2,e_3,e_4$1, partition $e_1,e_2,e_3,e_4$2 vertices into disjoint blocks of size $e_1,e_2,e_3,e_4$3, assign each block a copy of $e_1,e_2,e_3,e_4$4.
• The resulting hypergraph attains $e_1,e_2,e_3,e_4$5 edges and is $e_1,e_2,e_3,e_4$6-free.
• Characterization: The only extremal examples achieving the $e_1,e_2,e_3,e_4$7 bound are such unions of Steiner systems.

In the critical case $e_1,e_2,e_3,e_4$8, the hand-shaking lemma requires every vertex to have degree $e_1,e_2,e_3,e_4$9, and linearity + connectedness forces the block structure and graphs isomorphic to $|e_i|=r$0 (Adak et al., 24 Jan 2026).

4. Enumerative Formulas for Labelled 4-Edge Hypertrees

Enumeration for labelled $|e_i|=r$1-uniform hypertrees with $|e_i|=r$2 hyperedges is central to combinatorial theory. For $|e_i|=r$3 and $|e_i|=r$4:

• Total Number of Labelled Rooted Hypertrees:

$|e_i|=r$5

(where $|e_i|=r$6) (Lavault, 2011).

• Alternative Count (unrooted, labelled, explicit formula): $|e_i|=r$7 This formula scales super-exponentially in $|e_i|=r$8, dominated by the factorials and polynomial factor (Pitchanathan et al., 2017).
• Encoding Complexity: Average encoding requires

$|e_i|=r$9

bits, with closed expansion in terms of factorial logarithms.

5. General Enumeration Structure for Arbitrary Degree and Edge Sizes

The enumeration formula for hypertrees on $e_i\cap e_{i+1}=\{v_{i+1}\}$0 vertices with $e_i\cap e_{i+1}=\{v_{i+1}\}$1 hyperedges of sizes $e_i\cap e_{i+1}=\{v_{i+1}\}$2 and degree sequence $e_i\cap e_{i+1}=\{v_{i+1}\}$3 is given as follows:

$e_i\cap e_{i+1}=\{v_{i+1}\}$4

Define $e_i\cap e_{i+1}=\{v_{i+1}\}$5, $e_i\cap e_{i+1}=\{v_{i+1}\}$6, $e_i\cap e_{i+1}=\{v_{i+1}\}$7. Then

$e_i\cap e_{i+1}=\{v_{i+1}\}$8

Specialization to edge-lengths and degree-multisets produces exact counts for path-type, star-type, crown-type, etc. (Bacher, 2011).

6. Proof Methods and Structural Lemmas

• Degree-sum arguments: Used to bound minimal degrees in extremal hypergraphs (e.g., $e_i\cap e_{i+1}=\{v_{i+1}\}$9 for $i=1,2,3$0).
• Smoothing-transfer technique: Employed for $i=1,2,3$1 to cap excessive degree sums and analyze base–petal incidence.
• Forbidden-pattern lemma: Applied to check for the emergent structures that violate linearity or induce the forbidden hypertree.
• Partition–code bijections (Prüfer-like): Guarantee correctness and efficiency for combinatorial enumeration of rooted hypertrees.

These combinatorial, algebraic, and structural techniques underlie the rigorous Turán bounds and enumeration formulas.

7. Conjectures, Open Questions, and Significance

For the path configuration $i=1,2,3$2: $i=1,2,3$3 with equality under divisibility and existence conditions for Steiner systems. The matching lower bound is confirmed but upper tightness is conjectural (Adak et al., 24 Jan 2026).

Significance: The study of 4-edge hypertrees illustrates sharp contrasts. The “extended-star” $i=1,2,3$4 imposes strict density limitations, the crown $i=1,2,3$5 corresponds to sparser extremal structures, and the path $i=1,2,3$6 embodies the threshold of density mirroring the $i=1,2,3$7-bound. Cap-and-smoothing arguments for $i=1,2,3$8 are expected to generalize to other small linear hypertree configurations.

The exponential growth of enumeration formulas for increasing $i=1,2,3$9 highlights the combinatorial complexity and structural diversity of hypertrees. The dependence on block-partition combinatorics and degree constraints underlines the interplay between local vertex properties and global forbidden patterns.

---

References:

• (Adak et al., 24 Jan 2026) Bounds on Linear Turán Number for Trees
• (Pitchanathan et al., 2017) Improved Encoding and Counting of Uniform Hypertrees
• (Lavault, 2011) A note on Prüfer-like coding and counting forests of uniform hypertrees
• (Bacher, 2011) On the enumeration of labelled hypertrees and of labelled bipartite trees