Skip to main content
Springer Nature Link
Log in

A randomized embedding algorithm for trees

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a “self-avoiding tree-indexed random walk“. The order of the tree T can be as large as a constant fraction of the order of the graph G, and the maximum degree of T can be close to the minimum degree of G. We show that our algorithm works in a variety of interesting settings. For example, we prove that any graph of minimum degree d without 4-cycles contains every tree of order εd 2 and maximum degree at most d-2εd-2. As there exist d-regular graphs without 4-cycles and with O(d 2) vertices, this result is optimal up to constant factors. We prove similar nearly tight results for graphs of given girth and graphs with no complete bipartite subgraph K s,t .

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

References

  1. M. Ajtai, J. Komlós, M. Simonovits and E. Szemerédi: The exact solution of the Erdős-T. Sós conjecture for (large) trees, in preparation.

  2. N. Alon, M. Krivelevich and B. Sudakov: Embedding nearly-spanning bounded degree trees, Combinatorica27(6) (2007), 629–644.

    Article  MathSciNet  MATH  Google Scholar 

  3. N. Alon, L. Rónyai and T. Szabó: Norm-graphs: variations and applications; J. Combinatorial Theory Ser. B76 (1999), 280–290.

    Article  MATH  Google Scholar 

  4. I. Benjamini and Y. Peres: Markov chains indexed by trees, Ann. Probability22 (1994), 219–243.

    Article  MathSciNet  MATH  Google Scholar 

  5. I. Benjamini and O. Schramm: Every Graph with a Positive Cheeger Constant Contains a Tree with a Positive Cheeger Constant, Geometric and Functional Analysis7 (1997), 403–419.

    Article  MathSciNet  MATH  Google Scholar 

  6. C. T. Benson: Minimal regular graphs of girth eight and twelve, Canad. J. Math. 18 (1966), 1091–1094.

    MathSciNet  MATH  Google Scholar 

  7. S. N. Bhatt, F. Chung, F. T. Leighton and A. Rosenberg: Universal graphs for bounded-degree trees and planar graphs, SIAM J. Discrete Math. 2 (1989), 145–155.

    Article  MathSciNet  MATH  Google Scholar 

  8. S. Brandt and E. Dobson: The Erdős-Sós conjecture for graphs of girth 5, Discrete Math.150 (1996), 411–414.

    Article  MathSciNet  MATH  Google Scholar 

  9. P. Erdős, Z. Füredi, M. Loebl and V. T. Sós: Discrepancy of Trees, Studia Sci. Math. Hungarica30 (1995), 47–57.

    Google Scholar 

  10. P. Erdős and A. Rényi: On a problem in the theory of graphs (in Hungarian), Publ. Math. Inst. Hungar. Acad. Sci.7 (1962), 215–235.

    Google Scholar 

  11. J. Friedman and N. Pippenger: Expanding graphs contain all small trees, Combinatorica7(1) (1987), 71–76.

    Article  MathSciNet  MATH  Google Scholar 

  12. T. Jiang: On a conjecture about trees in graphs with large girth, J. Combinatorial Theory Ser. B83(2) (2001), 221–232.

    Article  Google Scholar 

  13. E. Győri: C6-free bipartite graphs and product representation of squares, Discrete Math.165/166 (1997), 371–375.

    Article  Google Scholar 

  14. P. Haxell and Y. Kohayakawa: The size-Ramsey number of trees, Israel J. Math.89(1–3) (1995), 261–274.

    Article  MathSciNet  MATH  Google Scholar 

  15. P. Haxell and T. Łuczak: Embedding trees into graphs of large girth, Discrete Math.216 (2000), 273–278.

    Article  MathSciNet  MATH  Google Scholar 

  16. P. Haxell: Tree embeddings, J. Graph Theory36 (2001), 121–130.

    Article  MathSciNet  MATH  Google Scholar 

  17. J. Kollár, L. Rónyai and T. Szabó: Norm-graphs and bipartite Turán numbers, Combinatorica16(3) (1996), 399–406.

    Article  Google Scholar 

  18. T. Kővári, V. T. Sós and P. Turán: On a problem of K. Zarankiewicz, Colloquium Math.3 (1954), 50–57.

    MathSciNet  Google Scholar 

  19. D. Kühn and D. Osthus: 4-cycles in graphs without a given even cycle, Journal of Graph Theory48 (2005), 147–156.

    Article  MathSciNet  MATH  Google Scholar 

  20. M. Krivelevich and B. Sudakov: Pseudo-random graphs, in: More Sets, Graphs and Numbers; Bolyai Society Mathematical Studies 15, Springer, 2006, pp. 199–262.

  21. M. Krivelevich and B. Sudakov: Minors in expanding graphs, Geometric and Functional Analysis19 (2009), 294–331.

    Article  MathSciNet  MATH  Google Scholar 

  22. N. Madras and G. Slade: The Self-Avoiding Walk, Birkhauser, Boston, 1993.

    MATH  Google Scholar 

  23. C. McDiarmid: Concentration, in: Probabilistic methods for algorithmic discrete mathematics, Algorithms and Combinatorics 16, Springer, Berlin, 1998, pp. 195–248.

    Google Scholar 

  24. A. Naor and J. Verstraëte: A note on bipartite graphs without 2k-cycles, Combinatorics, Probability and Computing14(5–6) (2005), 845–849.

    Article  MathSciNet  MATH  Google Scholar 

  25. L. Pósa: Hamiltonian circuits in random graphs, Discrete Math.14 (1976), 359–364.

    Article  MathSciNet  MATH  Google Scholar 

  26. B. Sudakov and J. Verstraëte: Cycle lengths in sparse graphs, Combinatorica28(3) (2008), 357–372.

    Article  MathSciNet  MATH  Google Scholar 

  27. W. F. de la Vega: Long paths in random graphs, Studia Sci. Math. Hungar.14 (1979), 335–340.

    MathSciNet  MATH  Google Scholar 

  28. W. F. de la Vega: Trees in sparse random graphs, J. Combinatorial Theory Ser. B45 (1988), 77–85.

    Article  MATH  Google Scholar 

  29. Y. Zhao: Proof of the (n/2-n/2-n/2) conjecture for large n, manuscript, 2007.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, UCLA, 520 Portola Plaza, Los Angeles, CA, 90095, USA

    Benny Sudakov

  2. IBM Almaden Research Center, 650 Harry Rd, San Jose, CA, 95120, USA

    Jan Vondrák

Authors
  1. Benny Sudakov
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Jan Vondrák
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Benny Sudakov.

Additional information

Research supported in part by NSF CAREER award DMS-0812005 and by an USA-Israeli BSF grant.

This work was done while the author was at Princeton University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sudakov, B., Vondrák, J. A randomized embedding algorithm for trees. Combinatorica 30, 445–470 (2010). https://doi.org/10.1007/s00493-010-2422-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-010-2422-5

Mathematics Subject Classification (2000)