No label defined (Q3797228)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4063144
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4063144

      Statements

      1987
      0 references
      stable graphs
      0 references
      Bondy-Chvátal-conjecture
      0 references
      constructing a counter-example
      0 references
      0 references
      A given graph F is called stable if, for any graph G of sufficiently large order n, whenever \(G+uv\) contains a subgraph isomorphic to F and \(d_ G(u)+d_ G(v)\geq 2n-4\) then G itself contains a subgraph isomorphic to F too. Bondy and Chvátal stated that graph \(C^ m_ s\) is stable whenever \(s\geq 2m+2\), where \(V(C^ m_ s)=\{v_ 1,v_ 2,...,v_ s\}\) and \(N(v_ i)=\{v_{i+1},v_{i+2},...,v_{i+m},v_{i-1},v_{i-2},...,v_{i- m}\}\) (all suffices reduce modulo s), \(i=1,2,...,s\). In this paper, the author disproves this statement by constructing a counter-example \[ H=\{(C^ m_ s-\{v_{m+2},v_{m+3}\})\cup \bar K_{n-s}\}\quad +\quad \{v_{m+2},v_{m+3}\} \] with \(m\geq 2\), \(s\geq \max \{2m+5,3m- 2\}\) and \(n\geq s\).
      0 references

      Identifiers