Line graph of a hypergraph

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 (Berge 1989).

Line graphs of k-uniform hypergraphs, k ≥ 3

Beineke (1968) 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 (1977) showed there is no such characterization by a finite list if k = 3.

Krausz (1943) 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 (1989).

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 et al. (1980). 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 & Tyshkevich (1997) and Jacobson, Kézdy & Lehel (1997) improved this bound to 19. At last Skums, Suzdal' & Tyshkevich (2005) reduced this bound to 16. Metelsky & Tyshkevich (1997) 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, and Shrikhande et al. (1980, 1982) 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 (Naik, Rao & Shrikhande et al. 1980, 1982, Jacobson, Kézdy & Lehel 1997, Metelsky & Tyshkevich 1997, and Zverovich 2004) under constraints on the minimum degree or the minimum edge degree of G. Minimum edge degree at least k3-2k2+1 in Naik et al. (1980) is reduced to 2k2-3k+1 in Jacobson, Kézdy & Lehel (1997) and Zverovich (2004) 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 (Jacobson, Kézdy & Lehel 1997 and Metelsky & Tyshkevich 1997). Skums, Suzdal' & Tyshkevich (2005) 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.[1] In other words, D(H) is the complement graph of L(H). An clique in D(H) corresponds to an independent set in L(H), and vice-versa.

gollark: I see.
gollark: Also, I may be wrong but I think a lot of generation things are more efficient at larger scales rather than smaller ones.
gollark: I'm not sure that's a good thing, though - if you have more interconnected locations, they can load-balance in case of high demand.
gollark: Isn't it already *fairly* decentralized? Different regions have their own grids, sort of thing?
gollark: Personally, I don't think anything which heavily centralizes power, i.e. dictators or centrally planned economies, is a good idea.

References
  • Beineke, L. W. (1968), "On derived graphs and digraphs", in Sachs, H.; Voss, H.; Walther, H. (eds.), Beitrage zur Graphentheorie, Leipzig: Teubner, pp. 17–23.
  • Berge, C. (1989), Hypergraphs: Combinatorics of Finite Sets, Amsterdam: North-Holland, MR 1013569. Translated from the French.
  • Heydemann, M. C.; Sotteau, D. (1976), "Line graphs of hypergraphs II", Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Colloq. Math. Soc. J. Bolyai, 18, pp. 567–582, MR 0519291.
  • Krausz, J. (1943), "Démonstration nouvelle d'une théorème de Whitney sur les réseaux", Mat. Fiz. Lapok, 50: 75–85, MR 0018403. (In Hungarian, with French abstract.)
  • Lovász, L. (1977), "Problem 9", Beiträge zur Graphentheorie und deren Anwendungen, Vorgetragen auf dem Internationalen Kolloquium in Oberhof (DDR), p. 313.
  • Naik, Ranjan N.; Rao, S. B.; Shrikhande, S. S.; Singhi, N. M. (1980), "Intersection graphs of k-uniform hypergraphs", Combinatorial mathematics, optimal designs and their applications (Proc. Sympos. Combin. Math. and Optimal Design, Colorado State Univ., Fort Collins, Colo., 1978), Annals of Discrete Mathematics, 6, pp. 275–279, MR 0593539.
  • Naik, Ranjan N.; Rao, S. B.; Shrikhande, S. S.; Singhi, N. M. (1982), "Intersection graphs of k-uniform linear hypergraphs", European Journal of Combinatorics, 3: 159–172, doi:10.1016/s0195-6698(82)80029-2, MR 0670849.
  • Skums, P. V.; Suzdal', S. V.; Tyshkevich, R. I. (2009), "Edge intersection of linear 3-uniform hypergraphs", Discrete Mathematics, 309: 3500–3517, doi:10.1016/j.disc.2007.12.082.
  • Voloshin, Vitaly I. (2009), Introduction to Graph and Hypergraph Theory, New York: Nova Science Publishers, Inc., MR 2514872
  1. Meshulam, Roy (2001-01-01). "The Clique Complex and Hypergraph Matching". Combinatorica. 21 (1): 89–94. doi:10.1007/s004930170006. ISSN 1439-6912.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.