arXiv Open Access 2016

Combinatorics of `unavoidable complexes'

Marija Jelić Milutinović Duško Jojić Marinko Timotijević Siniša T. Vrećica Rade T. Živaljević

Lihat Sumber

Abstrak

The partition number $π(K)$ of a simplicial complex $K\subset 2^{[n]}$ is the minimum integer $ν$ such that for each partition $A_1\uplus\ldots\uplus A_ν= [n]$ of $[n]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is $r$-unavoidable if $π(K)\leq r$. Motivated by the problems of Tverberg-Van Kampen-Flores type, and inspired by the `constraint method' of Blagojević, Frick, and Ziegler, arXiv:1401.0690 [math.CO], we study the combinatorics of $r$-unavoidable complexes.

Topik & Kata Kunci

math.CO

Penulis (5)

Marija Jelić Milutinović

Duško Jojić

Marinko Timotijević

Siniša T. Vrećica

Rade T. Živaljević

Format Sitasi

APA MLA BibTeX

Milutinović, M.J., Jojić, D., Timotijević, M., Vrećica, S.T., Živaljević, R.T. (2016). Combinatorics of `unavoidable complexes'. https://arxiv.org/abs/1612.09487

Akses Cepat

Lihat di Sumber

Informasi Jurnal

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