An approximate version of the tree packing conjecture

This publication has 20 references indexed in Scilit:

• The triangle-free process
  Advances in Mathematics, 2009
• Concentration for self‐bounding functions and an inequality of Talagrand
  Random Structures & Algorithms, 2006
• On packing trees into complete bipartite graphs
  Discrete Mathematics, 1997
• The Ramsey number R(3, t) has order of magnitude t²/log t
  Random Structures & Algorithms, 1995
• A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph
  Random Structures & Algorithms, 1990
• A note on packing trees into complete bipartite graphs and on fishburn's conjecture
  Discrete Mathematics, 1990
• Packing trees in complete graphs
  Discrete Mathematics, 1987
• On a Packing and Covering Problem
  European Journal of Combinatorics, 1985
• Balanced integer arrays: A matrix packing theorem
  Journal of Combinatorial Theory, Series A, 1983
• Subgraphs of graphs, I
  Discrete Mathematics, 1974