Abstract Determining the maximum size of a ‐intersecting code in was longstanding open problem Frankl and Füredi, solved independently by Ahlswede Khachatrian Tokushige. We extend their result to setting forbidden intersections, showing that for any large compared with (but not necessarily ) same bound holds codes weaker property being ‐avoiding, is, having no two vectors agree on exactly coord...

Effect of different fruit position on postharvest quality of F1 hybrid redfleshed watermelon Hi-U 16 was examined. In this study only one main vine was trained and maintained. The plants were allowed to set three fruits naturally at the first (8th - 11th nodes), second (13th - 16th nodes) and third (18th - 21th nodes) position. Fruits were harvested at 35 days after anthesis. Fruit weight, diam...

By representing and manipulating locations that hold widespread cultural significance, artists mediate the relationship between individuals city spaces. The photographic work of Cui Xiuwen explores complexity identity formation in Forbidden City, political center China. Studying nuances her piece One Day 2004 No. 6 reveals tension body spaces it inhabits. Though has emphasized dominating presen...

In this paper, we fix a graph H and ask into how many vertices each vertex of clique size n can be “split” such that the resulting is H-free. Formally: A an (n,k)-graph if its set pairwise disjoint union parts at most k, there edge between any two distinct parts. Letf(n,H)=min⁡{k∈N:there G H⊈G}. Barbanera Ueckerdt [4] observed f(n,H)=2 for not bipartite. If bipartite has well-defined Turán expo...