The complexity of proving that a graph is Ramsey

Number of the records: 1

1.

SYSNO	0474390
Title	The complexity of proving that a graph is Ramsey
Author(s)	Lauria, M. (SE) Pudlák, Pavel (MU-W)_{RID, SAI} Rödl, V. (US) Thapen, Neil (MU-W)_{RID, SAI}
Source Title	Combinatorica. Roč. 37, č. 2 (2017), s. 253-268. - : Springer
Document Type	Článek v odborném periodiku
Grant	IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
	GBP202/12/G061 GA ČR - Czech Science Foundation (CSF)
Institutional support	MU-W - RVO:67985840
Language	eng
Country	HU
Keywords	complexity * c-Ramsey graphs
Cooperating institutions	KTH Royal Institute of Technology (Sweden) Emory University (United States)
URL	http://link.springer.com/article/10.1007%2Fs00493-015-3193-9
Permanent Link	http://hdl.handle.net/11104/0271451

	File	Download	Size	Commentary	Version	Access
	Pudlak1.pdf	7	433.6 KB		Publisher’s postprint	require

Number of the records: 1