Norihide Tokushige

The Erdös-Ko-Rado Theorem for Integer Sequences

For positive integers

Some best possible inequalities concerning cross-intersecting families

n,k,t

The Erdos-Ko-Rado Theorem for Integer Sequences.

we investigate the problem how many integer sequences

The Minimum Area of Convex Lattice n -Gons

( a_1 ,a_2 , \cdots ,a_n )

Density theorems and extremal hypergraph problems

we can take, such that

Minimum shadows in uniform hypergraphs and a generalization of the Takagi function

1\leqq a_i \leqq k

Covers in Uniform Intersecting Families and a Counterexample to a Conjecture of Lovász

for

Random walks and multiply intersecting families

1\leqq i\leqq n

Binding numbers and f -factors of graphs

, and any two sequences agree in at least t positions. This problem was solved by Kleitman (J. Combin. Theory, 1 (1966), pp. 209–214) for

An Erdős-Ko-Rado theorem for cross t-intersecting families

k = 2