Filters
Note on the colored Tverberg theorem
BA - Obecná matematika
- 1996 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
A Geometric Proof of the Colored Tverberg Theorem
The colored Tverberg theorem asserts that for every d and r there exists t=t(d,r) such that for every set C in R^(d) of cardinality (d+1)t, partitioned into t-point subsets C_1,C_2,...,C_(d+1) (which we think of as colo...
BA - Obecná matematika
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Tverberg theorem
Tverberg proved that for a given set M of points of Eukleidian space E with a restriction to the number of these points and to the dimension of E there exists a partition of M such that convex classes of this partition have non-empty interse...
Pure mathematics
- 2019 •
- Jost •
- Link
Rok uplatnění
Jost - Ostatní články v recenzovaných periodicích
Výsledek na webu
A note on Hajos' theorem for list coloring
We present evidence that the current version of Hajos' theorem for list colorings is somewhat odd.
BA - Obecná matematika
- 2004 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
The last excluded case of Dirac's Map-Color Theorem for choosability
We finish the proof of Dirac's Map Color Theorem for choosability.
BA - Obecná matematika
- 2006 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
A Brooks-type Theorem for the Generalized List T-coloring
In the paper is proven a Brooks-type theorem for the generalized list T-coloring...
BA - Obecná matematika
- 2005 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Facial colorings using Hall's Theorem
We improve known upper bounds of the facial chromatic number using Hall's theorem.
BA - Obecná matematika
- 2010 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Brooks' Theorem via Alon-Tarsi Theorem
We prove Brooks' Theorem using the algebraic theorem of Alon-Tarsi.
BA - Obecná matematika
- 2010 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
A canonical Ramsey-type theorem for finite subsets of N
We show that whenever we color the finite subsets of N with arbitrarily many colors, we find a canonically colored arithmetic copy of an omega-forest. The five types of the canonical coloring are determined....
BA - Obecná matematika
- 2003 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Short Length Menger's Theorem and Reliable Optical Routing
We deal with a generalization of the minimum path coloring problem: given disjoint paths of the same color; the objective is to minimize the number of colors while maintaining the property that paths of the same color
BA - Obecná matematika
- 2005 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
- 1 - 10 out of 10 009