Back to Search
Start Over
SEVEN LARGEST TREES PACK.
- Source :
- Opuscula Mathematica; 2024, Vol. 44 Issue 5, p673-688, 16p
- Publication Year :
- 2024
-
Abstract
- The Tree Packing Conjecture (TPC) by Gyárfás states that any set of trees T<subscript>2</subscript>,...,<subscript>n-1</subscript>, Tn T<subscript>i</subscript> has i vertices pack into K<subscript>n</subscript>. The conjecture is true for bounded degree trees, but in general, it is widely open. Bollobás proposed a weakening of TPC which states that k largest trees pack. The latter is true if none tree is a star, but in general, it is known only for k = 5. In this paper we prove, among other results, that seven largest trees pack. [ABSTRACT FROM AUTHOR]
- Subjects :
- TREES
LOGICAL prediction
Subjects
Details
- Language :
- English
- ISSN :
- 12329274
- Volume :
- 44
- Issue :
- 5
- Database :
- Complementary Index
- Journal :
- Opuscula Mathematica
- Publication Type :
- Academic Journal
- Accession number :
- 178331693
- Full Text :
- https://doi.org/10.7494/OpMath.2024.44.5.673