Line graph of a hypergraph: Difference between revisions

Revision as of 05:52, 13 April 2008

Latest revision as of 17:30, 10 November 2023

(52 intermediate revisions by 34 users not shown)

Line 1:

{{short description|Generalization of line graphs to hypergraphs}}

{{cleanup}}

In [[mathematics]], a [[hypergraph]] is a generalization of a [[graph (mathematics)|graph]], where edges can contain any finite number of vertices, and the line graph of a hypergraph is a generalization of the [[line graph]] of a graph. The precise definition is that the '''line graph''' of a hypergraph is the graph whose vertex set is the set of edges of the hypergraph, with two edges adjacent when they have nonempty intersection. Thus, the line graph of a hypergraph is the same as the [[intersection graph]] of a family of finite sets.

In [[graph theory]], particularly in the theory of [[hypergraph]]s, the '''line graph of a hypergraph''' {{mvar|H}}, denoted {{math|L(''H'')}}, is the [[graph (discrete mathematics)|graph]] whose [[Vertex (graph theory)|vertex]] set is the [[Set (mathematics)|set]] of the hyperedges of {{mvar|H}}, with two vertices adjacent in {{math|L(''H'')}} when their corresponding hyperedges have a nonempty [[intersection]] in {{mvar|H}}. In other words, {{math|L(''H'')}} is the [[intersection graph]] of a family of [[finite set]]s. It is a [[generalization]] of the [[line graph]] of a [[Graph (discrete mathematics)|graph]].

However, the questions asked tend to be different. 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.

However, the questions asked tend to be different. 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 ''{{mvar|k''}} is called {{nowrap|'''{{mvar|k''' ''}}-uniform'''}}. (A 2-uniform hypergraph is a graph.). In hypergraph theory, it is often natural to require that hypergraphs be ''{{nowrap|{{mvar|k''}}-uniform}}. Every graph is the line graph of some hypergraph, but, given a fixed edge size ''{{mvar|k''}}, not every graph is a line graph of some ''{{nowrap|{{mvar|k''}}-uniform}} hypergraph. A main problem is to characterize those that are, for each {{math|''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).

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 (.<ref>{{harv|Berge |1989). }}</ref>

==Line graphs of ''k''-uniform hypergraphs, ''k'' &ge;≥ 3==

Beineke (<ref>{{harvtxt|Beineke|1968)}}</ref> characterized line graphs of graphs by a list of 9 [[forbidden induced subgraphssubgraph]]s. (See the article on [[line graph]]s.) No characterization by forbidden induced subgraphs is known of line graphs of k-uniform hypergraphs for any ''k'' ≥ 3, and Lóvász (Lovász<ref>{{harvtxt|Lovász|1977)}}</ref> showed there is no such characterization by a finite list if ''k'' = 3.

Krausz (<ref>{{harvtxt|Krausz|1943)}}</ref> characterized line graphs of graphs in terms of [[clique (graph theory)|clique]] covers. (See the[[Line articlegraph#Characterization onand linerecognition|Line graphsGraphs]].) A global characterization of Krausz type for the line graphs of ''k''-uniform hypergraphs for any ''k'' ≥ 3 was given by Berge (<ref>{{harvtxt|Berge|1989).}}</ref>

==Line graphs of ''k''-uniform linear hypergraphs, ''k'' &ge;≥ 3==

A global characterization of Krausz type for the line graphs of ''k''-uniform linear hypergraphs for any ''k'' ≥ 3 was given by Naik, etRao, al.Shrikhande, (and Singhi.<ref>{{harvtxt|Naik|Rao|Shrikhande|Singhi|1980)}}</ref> 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 etand al. (Tyshkevich<ref>{{harvtxt|Metelsky|Tyshkevich|1997)}}</ref> and Jacobson, etKézdy, al.(and Lehel<ref>{{harvtxt|Jacobson|Kézdy|Lehel|1997)}}</ref> improved this bound to 19. At Metelskylast etSkums, alSuzdal', and Tyshkevich<ref>{{harvtxt|Skums|Suzdal'|Tyshkevich|2009}}</ref> reduced this bound to 16. (Metelsky and Tyshkevich<ref>{{harvtxt|Metelsky|Tyshkevich|1997)}}</ref> 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.

==Line graphs of ''k''-uniform linear hypergraphs, ''k'' &ge; 3==

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 graphsgraph]]s 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 inof Naik, et al. (1980Rao, 1982)Shrikhande, 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.and Singhi<ref>

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).

{{harvtxt|Naik|Rao|Shrikhande|Singhi|1980}}, {{harvtxt|Naik|Rao|Shrikhande|Singhi|1982}}</ref> 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.

[[Image:Repeated_diamond_graphRepeated diamond graph.svg | 350px |center]]

Naik et al. (1980) found a finite list of forbidden induced subgraphs for linear 3-uniform hypergraphs with minimum vertex degree at least 69. Metelsky et al. (1997) and Jacobson et al.(1997) improved this bound to 19. Metelsky et al. (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.

There are some interesting characterizations available for line graphs of linear ''k''-uniform hypergraphs due to various authors (<ref>{{harvtxt|Naik et al. |Rao|Shrikhande|Singhi|1980}}, {{harvtxt|Naik|Rao|Shrikhande|Singhi|1982}}, {{harvnb|Jacobson et al. |Kézdy|Lehel|1997}}, {{harvnb|Metelsky et al. |Tyshkevich|1997}}, and {{harvnb|Zverovich |2004.)}}</ref> under constraints on the minimum degree or the minimum edge degree of G. Minimum edge degree at least ''k''³-2''k''²+1 in Naik, etRao, al.Shrikhande, and Singhi<ref>{{harvtxt|Naik|Rao|Shrikhande|Singhi|1980}}</ref> is reduced to 2''k''²-3''k''+1 in Jacobson, etKézdy, al.and (Lehel<ref>{{harvtxt|Jacobson|Kézdy|Lehel|1997)}}</ref> and Zverovich (<ref>{{harvtxt|Zverovich|2004)}}</ref> to characterize line graphs of ''k''-uniform linear hypergraphs for any ''k'' ≥ 3.

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 in Naik 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.

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 (Metelsky et al. <ref>{{harvnb|Jacobson|Kézdy|Lehel|1997}} and Jacobson et al. {{harvnb|Metelsky|Tyshkevich|1997).}}</ref> Skums, etSuzdal', al.and (2005)Tyshkevich<ref>{{harvtxt|Skums|Suzdal'|Tyshkevich|2009}}</ref> reduced the minimum degree to 10.

[[Image:Repeated_diamond_graph.svg | 350px |center]]

There are some interesting characterizations available for line graphs of linear ''k''-uniform hypergraphs due to various authors (Naik et al. 1980, 1982, Jacobson et al. 1997, Metelsky et al. 1997, and Zverovich 2004.) under constraints on the minimum degree or the minimum edge degree of G. Minimum edge degree at least ''k''³-2''k''²+1 in Naik et al. is reduced to 2''k''²-3''k''+1 in Jacobson et al. (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 (Metelsky et al. 1997 and Jacobson et al. 1997). Skums et al. (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 ==

==References==

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''.<ref>{{Cite journal|last=Meshulam|first=Roy|date=2001-01-01|title=The Clique Complex and Hypergraph Matching|journal=Combinatorica|language=en|volume=21|issue=1|pages=89–94|doi=10.1007/s004930170006|s2cid=207006642|issn=1439-6912}}</ref> In other words, D(''H'') is the [[complement graph]] of L(''H''). A [[Clique (graph theory)|clique]] in D(''H'') corresponds to an independent set in L(''H''), and vice versa.

== References ==

{{Reflist}}

*{{citation

| first = L. W. | last = Beineke

Line 40 ⟶ 41:

| editor3-first = H. | editor3-last = Walther

| publisher = Teubner | ___location = Leipzig | pages = 17–23 | year = 1968}}.

*{{citation|last=Berge|first=C.|title=Hypergraphs: Combinatorics of Finite Sets|year=1989|___location=Amsterdam|publisher=North-Holland|mr=1013569|authorlink=Claude Berge}}. Translated from the French.

*{{citation

| first = C. | last = Berge | authorlink = Claude Berge

| title = Hypergraphs: Combinatorics of Finite Sets

| ___location = Amsterdam | publisher = North-Holland | year = 1989

| id = {{MathSciNet | id = 1013569}}}}. Translated from the French.

*{{citation

| first1 = J. C. | last1 = Bermond

Line 52 ⟶ 47:

| first3 = D. | last3 = Sotteau

| title = Line graphs of hypergraphs I

| journal = [[Discrete Mathematics (journal)|Discrete Mathematics]] | volume = 18 | pages = 235–241 | year = 1977

| issue = 3

| id = {{MathSciNet | id = 0463003}} | doi = 10.1016/0012-365X(77)90127-3}}.

|mr=0463003 | doi = 10.1016/0012-365X(77)90127-3| url = https://hal.inria.fr/hal-02360671/file/21-BHS77-L%28H%29.pdf

}}.

*{{citation

Line 61 ⟶ 58:

| title = Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976)

| series = Colloq. Math. Soc. J. Bolyai

| volume = 18 | pages = 567–582 | year = 1976 | id mr= {{MathSciNet | id = 0519291}}}}.

*{{citation

Line 67 ⟶ 64:

| title = Démonstration nouvelle d'une théorème de Whitney sur les réseaux

| journal = Mat. Fiz. Lapok | volume = 50 | year = 1943 | pages = 75–85

| id mr= {{MathSciNet | id = 0018403}}}}. (In Hungarian, with French abstract.)

*{{citation

| first = L. | last = LóvászLovász | authorlink = László Lovász

| contribution = Problem 9

| title = BeitrageBeiträge zur Graphentheorie und deren AnsendungenAnwendungen

| series = VortgetragenVorgetragen auf dem internationalInternationalen ColloquiumKolloquium in Oberhof (DDR)

| year = 1977 | page = 313}}.

Line 81 ⟶ 78:

| first3 = Jeno | last3 = Lehel

| title = Recognizing intersection graphs of linear uniform hypergraphs

| journal = [[Graphs and Combinatorics]] | volume = 13 | pages = 359–367 | year = 1997

| issue = 4

| id = {{MathSciNet | id = 1485929}}}}.

|mr=1485929 | doi = 10.1007/BF03353014| s2cid = 9173731

}}.

*{{citation

Line 88 ⟶ 87:

| first2 = Regina | last2 = Tyshkevich

| year = 1997 | title = On line graphs of linear 3-uniform hypergraphs

| journal = Journal of Graph Theory | volume = 25 | issue = 4
| pages = 243–251

| id mr= {{MathSciNet | id = 1459889}} | doi = 10.1002/(SICI)1097-0118(199708)25:4<243::AID-JGT1>3.0.CO;2-K}}.

*{{citation

| first1 = R.Ranjan N. | last1 = Naik

| first2 = S. B. | last2 = Rao

| first3 = S. S. | last3 = Shrikhande | authorlink3 = S. S. Shrikhande

Line 99:

| title = Combinatorial mathematics, optimal designs and their applications (Proc. Sympos. Combin. Math. and Optimal Design, Colorado State Univ., Fort Collins, Colo., 1978)

| series = Annals of Discrete Mathematics | volume = 6 | pages = 275–279 | year = 1980

| id mr= {{MathSciNet | id = 0593539}}}}.

*{{citation

| first1 = R.Ranjan N. | last1 = Naik

| first2 = S. B. | last2 = Rao

| first3 = S. S. | last3 = Shrikhande | authorlink3 = S. S. Shrikhande

| first4 = N. M. | last4 = Singhi

| title = Intersection graphs of ''k''-uniform linear hypergraphs

| journal = European J.Journal of Combinatorics | volume = 3 | pages = 159–172 | year = 1982

| issue = 2

| id = {{MathSciNet | id = 0670849}}}}.

|mr=0670849 | doi=10.1016/s0195-6698(82)80029-2| doi-access = free }}.

*{{citation

Line 114 ⟶ 115:

| first2 = S. V. | last2 = Suzdal'

| first3 = R. I. | last3 = Tyshkevich

| title = Edge intersection of linear 3-unformuniform hypergraphs

| journal = Electronic Notes in Discrete Mathematics

| volume = 22309 | pages = 33–403500–3517 | year = 20052009 | doi = 10.1016/j.endmdisc.20052007.0612.007082| doi-access = free}}.

*{{citation

| first = Igor E. | last = Zverovich

| title = A solution to a problem of Jacobson, Kézdy and Lehel

| journal = [[Graphs and Combinatorics]] | volume = 20 | issue = 4 | year = 2004 | pages = 571–577

| id mr= {{MathSciNet | id = 2108401}} | doi = 10.1007/s00373-004-0572-1}}.| s2cid = 33662052

}}.

*{{citation

| first = Vitaly I. | last = Voloshin

| title = Introduction to Graph and Hypergraph Theory

| ___location = AmsterdamNew York | publisher = North-Holland[[Nova Science Publishers, Inc.]] | year = 19892009

|mr=2514872}}

[[Category:Graph families]]

[[Category:Hypergraphs]]