𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower bounds for the number of edges in hypergraphs of certain classes

✍ Scribed by D. A. Shabanov


Book ID
111455191
Publisher
SP MAIK Nauka/Interperiodica
Year
2010
Tongue
English
Weight
168 KB
Volume
82
Category
Article
ISSN
1064-5624

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


New Lower Bounds for Ramsey Numbers of G
✍ Felix Lazebnik; Dhruv Mubayi πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 146 KB πŸ‘ 1 views

## dedicated to the memory of rodica simion Let G be an r-uniform hypergraph. The multicolor Ramsey number r k G is the minimum n such that every k-coloring of the edges of the complete r-uniform hypergraph K r n yields a monochromatic copy of G. Improving slightly upon results from M. Axenovich,