arXiv Open Access 2017

Independent and maximal branching packing in infinite matroid-rooted digraphs

Attila Joó

Lihat Sumber

Abstrak

We prove a common generalization of the maximal independent arborescence packing theorem of Cs. Király and two of our earlier works about packing branchings in infinite digraphs.

Topik & Kata Kunci

math.CO

Penulis (1)

Attila Joó

Format Sitasi

APA MLA BibTeX

Joó, A. (2017). Independent and maximal branching packing in infinite matroid-rooted digraphs. https://arxiv.org/abs/1705.01016

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2017
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓