论文信息 - The binding number of a graph and its cliques

The binding number of a graph and its cliques

We consider the binding numbers of K"r-free graphs, and improve the upper bounds on the binding number which force a graph to contain a clique of order r. For the case r=4, we provide a construction for K"4-free graphs which have a larger binding number than the previously known constructions. This leads to a counterexample to a conjecture by Caro regarding the neighborhoods of independent sets.

Wayne Goddard | Jeremy Lyle

[1] D. R. Woodall. The binding number of a graph and its Anderson number , 1973 .

[2] Shi Ronghua. The binding number of a graph and its triangle , 1985 .

[3] Wayne Goddard,et al. Dense graphs with small clique number , 2011, J. Graph Theory.

[4] Binding number, cycles and complete graphs , 1981 .

[5] Jeremy Lyle. Homomorphisms of Graphs , 2008 .

[6] S. Brandt. Note: On the Structure of Graphs with Bounded Clique Number , 2003 .

[7] Paul Erdös,et al. On the connection between chromatic number, maximal clique and minimal degree of a graph , 1974, Discret. Math..

[8] Wayne Goddard,et al. A note on maximal triangle-free graphs , 1993, J. Graph Theory.

[9] Douglas R. Woodall,et al. Triangles and Neighbourhoods of Independent Sets in Graphs , 2000, J. Comb. Theory, Ser. B.

[10] R. Shi. The binding number of a graph and its pancyclism , 1987 .

[11] C. C. Chen,et al. Triangle-Free Graphs with Large Degree , 1997, Combinatorics, Probability and Computing.