A note on graphs without k-connected subgraphs

@article{Yuster2003ANO,
  title={A note on graphs without k-connected subgraphs},
  author={Raphael Yuster},
  journal={Ars Comb.},
  year={2003},
  volume={67}
}
Given integers k ≥ 2 and n ≥ k, let c(n, k) denote the maximum possible number of edges in an n-vertex graph which has no k-connected subgraph. It is immediate that c(n, 2) = n − 1. Mader [2] conjectured that for every k ≥ 2, if n is sufficiently large then c(n, k) ≤ (1.5k − 2)(n− k + 1), where equality holds whenever k − 1 divides n. In this note we prove that when n is sufficiently large then c(n, k) ≤ 193 120 (k − 1)(n − k + 1) < 1.61(k − 1)(n − k + 1), thereby coming rather close to the… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Connectivity and edge-connectivity in finite graphs, In: Surveys

  • W. Mader
  • 1979
Highly Influential
4 Excerpts

Extremal Graph Theory

  • B. Bollobás
  • 1978
3 Excerpts

Existenz n-fach zusammenhängender teilgraphen in graphen genügend grossen kantendichte

  • W. Mader
  • Abh. Math. Sem. Hamburg Univ
  • 1972
2 Excerpts

Similar Papers

Loading similar papers…