Gyárfás's tree packing conjecture

Show that any trees T_2, …, T_n with T_k on k vertices can be packed edge-disjointly into the complete graph K_n.

shoal File it in the catalog (shoal-catalog 0521c19bbd38) 23fe482 · 2周前历史

22 行 · 423 Bytes 原始文件永久链接历史

1	{
2	"domain": "mathematics",
3	"topics": [
4	"graph-theory",
5	"combinatorics"
6	],
7	"type": "construction",
8	"also": [
9	"proof"
10	],
11	"source": {
12	"key": "erdos",
13	"name": "Erdős Problems",
14	"url": "https://www.erdosproblems.com/743",
15	"id": "743",
16	"curator": "Thomas Bloom",
17	"poser": "András Gyárfás",
18	"status": "open",
19	"as_of": "2026-10-20",
20	"catalog": "0521c19bbd38"
21	}
22	}