论文信息 - A short proof of fisher's inequality

A short proof of fisher's inequality

Nous donnons ici une demonstration nouvelle, tres courte, de l'inegalite de Fisher, qui generalise un resultat bien connu de de Bruijn et Erdos. Cette demonstration utilise essentiellement une idee de Tverberg (1982) pour demontrer un autre enonce combinatoire.

Renaud Palisse

[1] Qingxue Huang. On the decomposition of Kn into complete m-partite graphs , 1991, J. Graph Theory.

[2] Dan Pritikin. Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs , 1986, J. Graph Theory.

[3] H. Tverberg,et al. On the decomposition of kn into complete bipartite graphs , 1982, J. Graph Theory.

[4] H. Ryser,et al. An extension of a theorem of de Bruijn and Erdös on combinatorial designs , 1968 .

[5] P. Seymour. ON THE TWO-COLOURING OF HYPERGRAPHS , 1974 .