Portal de Periódicos da CAPES

On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size

2012; Cambridge University Press; Volume: 21; Issue: 1-2 Linguagem: Inglês

10.1017/s0963548311000496

1469-2163

Péter Frankl, Vojtěch Rödl, Andrzej Ruciński,

graph theory and CDMA systems

In 1965 Erdős conjectured a formula for the maximum number of edges in a k -uniform n -vertex hypergraph without a matching of size s . We prove this conjecture for k = 3 and all s ≥ 1 and n ≥ 4 s .