Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Abstract   Let  W  ⊆  V  in a graph  G  = ( V ,  E ) such that  W  ∩  X  ≠  O  for each fragment  X  of  G . Then  G  is defined to be  W -locally ( k ,  l )-critical if  κ ( G  −  W ′) =  k  −  W ′ holds for every  W ′ ⊆  W  with. In this note  give a short proof for the following recent result of Su: every non-complete  W -locally ( k ,  l )-critical graph has (2 l  + 2) distinct ends and  bW ⩾ 2 l  + 2. (This result implies that Slater's conjecture is true: there exist no ( k ,  l )-critical graphs with 2 l  >  k , except  K   k  + 1 .)
['Tibor Jordán']
I am writing a research paper on a idea On the existence of (k,l) -critical graphs
[{"from": "human", "value": "I am writing a research paper on a idea On the existence of (k,l) -critical graphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Abstract   Let  W  \u2286  V  in a graph  G  = ( V ,  E ) such that  W  \u2229  X  \u2260  O  for each fragment  X  of  G . Then  G  is defined to be  W -locally ( k ,  l )-critical if  \u03ba ( G  \u2212  W \u2032) =  k  \u2212  W \u2032 holds for every  W \u2032 \u2286  W  with. In this note  give a short proof for the following recent result of Su: every non-complete  W -locally ( k ,  l )-critical graph has (2 l  + 2) distinct ends and  bW \u2a7e 2 l  + 2. (This result implies that Slater's conjecture is true: there exist no ( k ,  l )-critical graphs with 2 l  >  k , except  K   k  + 1 .)"}]