Helly’s property for n-cliques and the degree of a graph
Article
- 20 Downloads
Abstract
The main result of the paper is as follows: If a maximal clique of a graph G has n vertices, the degree of every vertex of G is less than \([\frac{5}{3}n] - 1\), and any two n-cliques from a family of n-cliques have a nonempty intersection, then each of the n-cliques in this family has more than n/3 vertices. This result is shown to be sharp. Bibliography: 6 titles.
Keywords
Maximal Clique Adjacent Vertex Similar Fact Classical Paper Partial Characterization
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.H.-J. Bandelt and E. Prisner, “Clique graphs and Helly graphs,” J. Combin. Theory, Ser. B, 51, No. 1, 34–45 (1991).MATHCrossRefGoogle Scholar
- 2.P. Erdös and T. Gallai, “On minimal number of vertices representing the edges of a graph,” Publ. Math. Inst. Hung. Acad. Sci., 6, 89–96 (1961).Google Scholar
- 3.A. Farrugia, “Clique-Helly graphs and hereditary clique-Helly graphs,” www.alastairfarrugia.net/clique-Helly.ps.Google Scholar
- 4.R. Hamelink, “A partial characterization of clique graphs,” J. Combin. Theory, Ser. B, 5, 192–197 (1968).MATHGoogle Scholar
- 5.F. Roberts and J. Spencer, “Characterization of clique-graphs,” J. Combin. Theory, Ser. B, 10, 102–108 (1971).MATHGoogle Scholar
- 6.W. T. Tatte, Graph Theory [Russian translation], Mir, Moscow (1988).Google Scholar
Copyright information
© Springer Science+Business Media, Inc. 2007