Эта публикация цитируется в 29 статьях

Non-three-colourable common graphs exist

H. Hatami^a, J. Hladký^bc, D. Král'^d, S. Norine^e, A. Razborov<sup>f

a</sup> School of Computer Science, McGill University, Montreal, Canada
^b Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Malostranské náměstí 25, 118 00 Prague, Czech Republic
^c DIMAP, Department of Computer Science, University of Warwick, Coventry CV4 7AL, UK
^d Institute for Theoretical Computer Science, Faculty of Mathematics and Physics, Charles University, Malostranské náměstí 25, 118 00 Prague, Czech Republic
^e Department of Mathematics, Princeton University, Princeton, NJ, USA
^f Department of Computer Science, University of Chicago, IL, USA

Поступила в редакцию: 19.05.2011
Исправленный вариант: 07.02.2012

Язык публикации: английский

DOI: 10.1017/S0963548312000107

Реферативные базы данных:

• 
• 
• 
•