On packing trees into complete bipartite graphs

Raphael Yuster

doi:10.1016/S0012-365X(96)00014-3

On packing trees into complete bipartite graphs

Research output: Contribution to journal › Article › peer-review

Abstract

Let {T₂, ... , T_t} be a sequence of trees, where T_i has i vertices. We show that if t < 0.79n, then the sequence can be packed into the complete bipartite graph K_n-1,n/2(K_n,(n-1)/2), where n is even (odd). This significantly improves the result which appears in [2].

Original language	English
Pages (from-to)	325-327
Number of pages	3
Journal	Discrete Mathematics
Volume	163
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(96)00014-3
State	Published - 15 Jan 1997
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/S0012-365X(96)00014-3

Cite this

@article{99ed3bef07c54f09b7032ca8b1738e05,

title = "On packing trees into complete bipartite graphs",

abstract = "Let \{T2, ... , Tt\} be a sequence of trees, where Ti has i vertices. We show that if t < 0.79n, then the sequence can be packed into the complete bipartite graph Kn-1,n/2(Kn,(n-1)/2), where n is even (odd). This significantly improves the result which appears in [2].",

author = "Raphael Yuster",

year = "1997",

month = jan,

day = "15",

doi = "10.1016/S0012-365X(96)00014-3",

language = "English",

volume = "163",

pages = "325--327",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - On packing trees into complete bipartite graphs

AU - Yuster, Raphael

PY - 1997/1/15

Y1 - 1997/1/15

N2 - Let {T2, ... , Tt} be a sequence of trees, where Ti has i vertices. We show that if t < 0.79n, then the sequence can be packed into the complete bipartite graph Kn-1,n/2(Kn,(n-1)/2), where n is even (odd). This significantly improves the result which appears in [2].

AB - Let {T2, ... , Tt} be a sequence of trees, where Ti has i vertices. We show that if t < 0.79n, then the sequence can be packed into the complete bipartite graph Kn-1,n/2(Kn,(n-1)/2), where n is even (odd). This significantly improves the result which appears in [2].

UR - https://www.scopus.com/pages/publications/0042096274

U2 - 10.1016/S0012-365X(96)00014-3

DO - 10.1016/S0012-365X(96)00014-3

M3 - Article

AN - SCOPUS:0042096274

SN - 0012-365X

VL - 163

SP - 325

EP - 327

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

On packing trees into complete bipartite graphs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this