A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Upper bound in the Erdős-Hajnal problem of hypergraph coloring
Upper bound in the Erdős-Hajnal problem of hypergraph coloring
Upper bound in the Erdős-Hajnal problem of hypergraph coloring
Teplyakov, S. M. (author)
MATHEMATICAL NOTES -NEW YORK- C/C OF MATEMATICHESKIE ZAMETIK ; 93 ; 191-195
2013-01-01
5 pages
Article (Journal)
English
DDC:
510
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Improvement of the lower bound in the Kostochka problem of panchromatic coloring of a hypergraph
| British Library Online Contents | 2011
On the Erdős-Hajnal problem for 3-uniform hypergraphs
| British Library Online Contents | 2013
| British Library Online Contents | 2015
| British Library Online Contents | 2008
The Erdős-Szekeres theorem and congruences
| British Library Online Contents | 2010