Graphs whose every independent set has a common neighbour
暂无分享,去创建一个
A graph is said to have property I if every independent set of its vertices has a common neighbour. The following conjecture of P. Erdos and S. Fajtlowicz is proved: There exists a constant c>0 such that any triangle free graph with property I has a vertex of degree >=c|V(G)|. (This is true with c=13 and this value is best possible.) The complete characterization of the graphs having the above properties is given. In the last section we deal with graphs satisfying some weaker conditions.
[1] Paul Erdös,et al. On an extremal problem in graph theory , 1970 .
[2] P. Erdös,et al. Graph Theory and Probability , 1959 .
[3] P. Erdös. On the construction of certain graphs , 1966 .
[4] W. G. Brown. On Graphs that do not Contain a Thomsen Graph , 1966, Canadian Mathematical Bulletin.
[5] A. Rényii,et al. ON A PROBLEM OF GRAPH THEORY , 1966 .