H. Hatami, J. Hladký, D. Král', S. Norine, A. Razborov, “Non-three-colourable common graphs exist”, Comb. Probab. Comput., 2012, Volume 21, Issue 5,Pages <nobr>734–742</nobr>

RUS ENG

JOURNALS // Combinatorics, Probability and Computing // Archive

Comb. Probab. Comput., 2012, Volume 21, Issue 5, Pages 734–742 (Mi cpc2)

This article is cited in 29 papers

Non-three-colourable common graphs exist

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

^a 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

Received: 19.05.2011
Revised: 07.02.2012

Language: English

DOI: 10.1017/S0963548312000107

Cited by

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024