science

Line graph of a hypergraph

Line graph of a hypergraph is a science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Line graph of a hypergraph rather than just read about it. In short: In graph theory, particularly in the theory of hypergraphs, the line graph of a hypergraph H, denoted L(H), is the graph whose vertex set is the set of the hyperedges of H, with two vertices adjacent in L(H) when their corresponding hyperedges have a nonempty intersection in H. In other words, L(H) is the intersection graph of a family of finite sets.

Key takeaways

Line graph of a hypergraph belongs to science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Line graph of a hypergraph to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Line graph of a hypergraph from memory before moving on to harder problems.

Reference excerpt

In graph theory, particularly in the theory of hypergraphs, the line graph of a hypergraph H, denoted L(H), is the graph whose vertex set is the set of the hyperedges of H, with two vertices adjacent in L(H) when their corresponding hyperedges have a nonempty intersection in H. In other words, L(H) is the intersection graph of a family of finite sets. It is a generalization of the line graph of a graph. Questions about line graphs of hypergraphs are often generalizations of questions about line graphs of graphs. For instance, a hypergraph whose edges all have size k is called k-uniform. (A 2-uniform hypergraph is a graph). In hypergraph theory, it is often natural to require that hypergraphs be k-uniform. Every graph is the line graph of some hypergraph, but, given a fixed edge size k, not every graph is a line graph of some k-uniform hypergraph. A main problem is to characterize those that are, for each k ≥ 3. A hypergraph is linear if each pair of hyperedges intersects in at most one vertex. Every graph is the line graph, not only of some hypergraph, but of some linear hypergraph.

Line graphs of k-uniform hypergraphs, k ≥ 3 Beineke characterized line graphs of graphs by a list of 9 forbidden induced subgraphs. (See the article on line graphs.) No characterization by forbidden induced subgraphs is known of line graphs of k-uniform hypergraphs for any k ≥ 3, and Lovász showed there is no such characterization by a finite list if k = 3. Krausz characterized line graphs of graphs in terms of clique covers. (See Line Graphs.) A global characterization of Krausz type for the line graphs of k-uniform hypergraphs for any k ≥ 3 was given by Berge

Line graphs of k-uniform linear hypergraphs, k ≥ 3 A global characterization of Krausz type for the line graphs of k-uniform linear hypergraphs for any k ≥ 3 was given by Naik, Rao, Shrikhande, and Singhi. At the same time, they found a finite list of forbidden induced subgraphs for linear 3-uniform hypergraphs with minimum vertex degree at least 69. Metelsky|l and Tyshkevich and Jacobson, Kézdy, and Lehel improved this bound to 19. At last Skums, Suzdal', and Tyshkevich reduced this bound to 16. Metelsky and Tyshkevich also proved that, if k > 3, no such finite list exists for linear k-uniform hypergraphs, no matter what lower bound is placed on the degree. The difficulty in finding a characterization of linear k-uniform hypergraphs is due to the fact that there are infinitely many forbidden induced subgraphs. To give examples, for m > 0, consider a chain of m diamond graphs such that the consecutive diamonds share vertices of degree two. For k ≥ 3, add pendant edges at every vertex of degree 2 or 4 to get one of the families of minimal forbidden subgraphs of Naik, Rao, Shrikhande, and Singhi as shown here. This does not rule out either the existence of a polynomial recognition or the possibility of a forbidden induced subgraph characterization similar to Beineke's of line graphs of graphs.

There are some interesting characterizations available for line graphs of linear k-uniform hypergraphs due to various authors under constraints on the minimum degree or the minimum edge degree of G. Minimum edge degree at least k3-2k2+1 in Naik, Rao, Shrikhande, and Singhi is reduced to 2k2-3k+1 in Jacobson, Kézdy, and Lehel and Zverovich to characterize line graphs of k-uniform linear hypergraphs for any k ≥ 3. The complexity of recognizing line graphs of linear k-uniform hypergraphs without any constraint on minimum degree (or minimum edge-degree) is not known. For k = 3 and minimum degree at least 19, recognition is possible in polynomial time. Skums, Suzdal', and Tyshkevich reduced the minimum degree to 10. There are many interesting open problems and conjectures in Naik et al., Jacoboson et al., Metelsky et al. and Zverovich.

Disjointness graph The disjointness graph of a hypergraph H, denoted D(H), is the graph whose vertex set is the set of the hyperedges of H, with two vertices adjacent in D(H) when their corresponding hyperedges are disjoint in H. In other words, D(H) is the complement graph of L(H). A clique in D(H) corresponds to an independent set in L(H), and vice versa.

References

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Line graph of a hypergraph

Start with the simplest possible case. Write down what Line graph of a hypergraph claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Line graph of a hypergraph before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Line graph of a hypergraph ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Line graph of a hypergraph

In research: Line graph of a hypergraph appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Line graph of a hypergraph in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Line graph of a hypergraph is common in secondary-school and first-year university syllabi. It links to neighbouring topics Graph families, Hypergraphs, so understanding it makes those chapters shorter.
In everyday life: Look for Line graph of a hypergraph outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Line graph of a hypergraph in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Line graph of a hypergraph means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Line graph of a hypergraph out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Line graph of a hypergraph in simple terms?

Why does Line graph of a hypergraph matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Line graph of a hypergraph?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Line graph of a hypergraph.