✦ LIBER ✦

On Erdős' extremal problem on matchings in hypergraphs

✍ Scribed by Łuczak, Tomasz; Mieczkowska, Katarzyna

Book ID: 122257415
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 322 KB
Volume: 124
Category: Article
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2014.01.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On An Extremal Hypergraph Problem Of Bro

On An Extremal Hypergraph Problem Of Brown, Erdős And Sós

✍ Noga Alon*; Asaf Shapira† 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 286 KB

On the Erdős-Hajnal problem for 3-unifor

On the Erdős-Hajnal problem for 3-uniform hypergraphs

✍ Akol’zin, I. A. 📂 Article 📅 2013 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 508 KB

Upper bound in the Erdős-Hajnal problem

Upper bound in the Erdős-Hajnal problem of hypergraph coloring

✍ Teplyakov, S. M. 📂 Article 📅 2013 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 534 KB

On a Problem of Erdős

✍ G. Dombi; B. Valkó 📂 Article 📅 1997 🏛 Akadmiai Kiad 🌐 English ⚖ 295 KB

On a Problem of Erdős

✍ Csaba Sándor 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Theorem 1. For every n 2 there exist integers 1<a 1 <a 2 < } } } <a s such that s i=1 1Âa i <n and this sum cannot be split into n parts so that all partial sums are 1.

On a problem of Erdős

✍ Jin-Hui Fang, Yong-Gao Chen 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 229 KB