𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Extremal Problem in Colored Uniform Hypergraphs

✍ Scribed by GONGBEN WANG; C. L. LIU; JINGSHENG CONG


Book ID
119862804
Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
313 KB
Volume
576
Category
Article
ISSN
0890-6564

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On an Extremal Problem for Colored Trees
✍ P. Valtr πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 93 KB

Let T be a tree such that there is a proper n-coloring c of the vertices of T which, besides a technical condition, is a k b k a k -free, i.e., T contains no subdivision of a path u 1 , . . . , Then T has O(kn) vertices. (The technical condition requires that T contains no subdivision of a properly