This little post is meant to be technically useful, pointing out one of the myriad clashes of terminology that exist in just about any science.

I happenend to know the term “star hypergraph” for a long time, but only in what I thought the only and usual sense (applying to “hypergraph” in the most standard sense nowadays: set of subsets sets of a specified set).

Yesterday I saw that within the digraph-theoretic literature, there is a another meaning of “star hypergraph”. So here there are the two definitions, for the benefit of others who are puzzled by someone else using “star hypergraph” in another way than what one is used to, and turning to search engines for help.

**Definition** (star hypergraph; usual meaning for abstract hypergraphs; cf. e.g. the article J. Beck, *Surplus of Graphs and the Lovász Local Lemma.* Section 1)**.**

Suppose is an abstract hypergraph. (I.e. is a set and .) Then is called a *star hypergraph* if and only if (writing for the cardinality of a set)

- for all , ,
- for all
*,**.*

**Remark.** Obviously, axioms 1. and 2. are independent. To see 1. 2., consider any…err…star?…consisting of more than two hyperedges, any two of which intersect in precisely one ground-set element; this “star”, which in hypergraph-theory is more usually referred to by the whimsical-yet-evocative name *sunflower, *or the technical term *-system*, is not a “star hypergraph”, since 2. is false. To see 2. 1., an easy counterexample is the hypergraph consisting of countably-infinitely-many four-element contiguous subsets (aka intervals) of , any two consecutive of which interesecting in exactly two ground-set-elements: there, every ground-set element is in precisely two hyperedges, so 2. is true, but 1. is false.

**Definition** (star hypergraph; a meaning in digraph-theory ; cf. e.g. the article Jørgen Bang-Jensen, Stéphan Thomassé: *Highly connected hypergraphs containing no two **edge-disjoint spanning connected subhypergraphs. *Below Theorem 3)**.**

A *star hypergraph* consists of data

- an abstract hypergraph (I.e. a set and .)
- a function

subject to the one axiom

- for all , .

**Remark.** Of course, the latter definition of “star hypergraph” is (equivalently) nothing else than a **family of pointed sets**.

**Remark.** Needless to say, the two above definition of star hypergraph do not have anything naturally to do with one another. They are already type-wise different, the latter “star hypergraph” having one more piece of specified data (the function ), and lacking the two axioms of the former “star hypergraph”.