Abstract.
We solve a problem proposed by Jacobson, Kézdy, and Lehel [4] concerning the existence of forbidden induced subgraph characterizations of line graphs of linear k-uniform hypergraphs with sufficiently large minimal edge-degree. Actually, we prove that for each k≥3 there is a finite set Z(k) of graphs such that each graph G with minimum edge-degree at least 2k2−3k+1 is the line graph of a linear k-uniform hypergraph if and only if G is a Z(k)-free graph.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Acknowledgments. We thank the anonymous referees, whose suggestions helped to improve the presentation of the paper.
Winter 2002/2003 DIMACS Award is gratefully acknowledged
2000 Mathematics Subject Classification: 05C65 (05C75, 05C85)
Rights and permissions
About this article
Cite this article
Zverovich, I. A Solution to a Problem of Jacobson, Kézdy and Lehel. Graphs and Combinatorics 20, 571–577 (2004). https://doi.org/10.1007/s00373-004-0572-1
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s00373-004-0572-1