Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-27T22:32:41.459Z Has data issue: false hasContentIssue false
  • English
  • Français

Decompositions into Subgraphs of Small Diameter

Published online by Cambridge University Press:  09 June 2010

JACOB FOX  and
BENNY SUDAKOV
JACOB FOX
Affiliation:
Department of Mathematics, Princeton, Princeton, NJ, USA (e-mail: jacobfox@math.princeton.edu)
BENNY SUDAKOV
Affiliation:
Department of Mathematics, UCLA, Los Angeles, CA 90095, USA (e-mail: bsudakov@math.ucla.edu)
Get access Rights & Permissions [Opens in a new window]

Abstract

We investigate decompositions of a graph into a small number of low-diameter subgraphs. Let P(n, ε, d) be the smallest k such that every graph G = (V, E) on n vertices has an edge partition E = E0 ∪ E1 ∪ ⋅⋅⋅ ∪ Ek such that |E0| ≤ εn2, and for all 1 ≤ i ≤ k the diameter of the subgraph spanned by Ei is at most d. Using Szemerédi's regularity lemma, Polcyn and Ruciński showed that P(n, ε, 4) is bounded above by a constant depending only on ε. This shows that every dense graph can be partitioned into a small number of ‘small worlds’ provided that a few edges can be ignored. Improving on their result, we determine P(n, ε, d) within an absolute constant factor, showing that P(n, ε, 2) = Θ(n) is unbounded for ε < 1/4, P(n, ε, 3) = Θ(1/ε2) for ε > n−1/2 and P(n, ε, 4) = Θ(1/ε) for ε > n−1. We also prove that if G has large minimum degree, all the edges of G can be covered by a small number of low-diameter subgraphs. Finally, we extend some of these results to hypergraphs, improving earlier work of Polcyn, Rödl, Ruciński and Szemerédi.

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 19 , Issue 5-6: Papers from the 2009 Oberwolfach Meeting on Combinatorics and Probability , November 2010 , pp. 753 - 774
Copyright
Copyright © Cambridge University Press 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Alon, N., Gyárfás, A. and Ruszinkó, M. (2000) Decreasing the diameter of bounded degree graphs. J. Graph Theory 35 161–172.3.0.CO;2-Y>CrossRefGoogle Scholar
[2]Chung, F. and Garey, M. (1984) Diameter bounds for altered graphs. J. Graph Theory 8 511–534.CrossRefGoogle Scholar
[3]Erdős, P., Gyárfás, A. and Ruszinkó, M. (1998) How to decrease the diameter of triangle-free graphs, Combinatorica 18 493–501.Google Scholar
[4]Erdős, P., Pach, J., Pollack, R. and Tuza, Z. (1989) Radius, diameter, and minimum degree. J. Combin. Theory Ser. B 47 73–79.CrossRefGoogle Scholar
[5]Erdős, P. and Rényi, A. (1962) On a problem in the theory of graphs (in Hungarian). Publ. Math. Inst. Hungar. Acad. Sci. 7 623–641.Google Scholar
[6]Erdős, P., Rényi, A. and Sós, V. T. (1966) On a problem of graph theory. Studia Scientarium Mathematicarum Hungar. 1 215–235.Google Scholar
[7]Erdős, P. and Simonovits, M. (1983) Supersaturated graphs and hypergraphs. Combinatorica 3 181–192.CrossRefGoogle Scholar
[8]Hatami, H. Graph norms and Sidorenko's conjecture. Israel J. Math., to appear.Google Scholar
[9]Linial, N. and Saks, M. (1993) Low diameter graph decompositions. Combinatorica 13 441–454.CrossRefGoogle Scholar
[10]Lovász, L. (1978) Kneser's conjecture, chromatic number, and homotopy. J. Combin. Theory Ser. A 25 319.CrossRefGoogle Scholar
[11]Polcyn, J., Rödl, V., Ruciński, A. and Szemerédi, E. (2006) Short paths in quasi-random triple systems with sparse underlying graphs. J. Combin. Theory Ser. B 96 584–607.CrossRefGoogle Scholar
[12]Polcyn, J. and Ruciński, A. (2009) Short paths in ε-regular pairs and small diameter decompositions of dense graphs. Discrete Math. 309 6375–6381.CrossRefGoogle Scholar
[13]Sidorenko, A. F. (1993) A correlation inequality for bipartite graphs. Graphs Combin. 9 201–204.CrossRefGoogle Scholar
[14]Simonovits, M. (1984) Extremal graph problems, degenerate extremal problems and super-saturated graphs. In Progress in Graph Theory (Bondy, J. A., ed.), Academic, New York, pp. 419–437.Google Scholar