✦ LIBER ✦

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

✍ Scribed by Teplyakov, S. M.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Improvement of the lower bound in the Er

✍ D. A. Shabanov 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 104 KB

Improvement of the lower bound in the Ko

✍ A. P. Rozovskaya; D. A. Shabanov 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 460 KB

Near optimal bounds for the Erdős distin

✍ József Solymosi; Van H. Vu 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 220 KB

Large matchings in uniform hypergraphs a

✍ Noga Alon; Peter Frankl; Hao Huang; Vojtech Rödl; Andrzej Ruciński; Benny Sudako 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 227 KB

Lower bounds in the combinatorial proble

✍ D. A. Shabanov 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 164 KB