Partitions of graphs with high minimum degree or connectivity

@article{Khn2003PartitionsOG,
  title={Partitions of graphs with high minimum degree or connectivity},
  author={Daniela K{\"u}hn and Deryk Osthus},
  journal={J. Comb. Theory, Ser. B},
  year={2003},
  volume={88},
  pages={29-43}
}
We prove that there exists a function f ðcÞ such that the vertex set of every f ðcÞ-connected graph G can be partitioned into sets S and T such that each vertex in S has at least c neighbours in T and both G1⁄2S and G1⁄2T are c-connected. This implies that there exists a function gðc;HÞ such that every gðc;HÞ-connected graph contains a subdivision TH of H so that G VðTHÞ is c-connected. We also prove an analogue with connectivity replaced by minimum degree. Furthermore, we show that there… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Graph Theory

  • R. Diestel
  • Graduate Texts in Mathematics, Vol. 173, Springer…
  • 1997

Graph partitions

  • T. D. Porter
  • J. Combin. Math. Combin. Comput 15
  • 1994
2 Excerpts

Similar Papers

Loading similar papers…