Počet záznamů: 1
The complexity of proving that a graph is Ramsey
SYS 0474390 LBL 01000a^^22220027750^450 005 20240103214032.7 014 $a 85018519537 $2 SCOPUS 014 $a 000399890000008 $2 WOS 017 $a 10.1007/s00493-015-3193-9 $2 DOI 100 $a 20170507d m y slo 03 ba 101 $a eng $d eng 102 $a HU 200 1-
$a The complexity of proving that a graph is Ramsey 215 $a 16 s. 463 -1
$1 001 cav_un_epca*0256429 $1 011 $a 0209-9683 $e 1439-6912 $1 200 1 $a Combinatorica $v Roč. 37, č. 2 (2017), s. 253-268 $1 210 $c Springer 610 $a complexity 610 $a c-Ramsey graphs 700 -1
$3 cav_un_auth*0293605 $4 070 $a Lauria $b M. $y SE 701 -1
$3 cav_un_auth*0100699 $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $w Mathematical Logic and Theoretical Computer Science $4 070 $a Pudlák $b Pavel $p MU-W $y CZ $T Matematický ústav AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0045922 $4 070 $a Rödl $b V. $y US 701 -1
$3 cav_un_auth*0246710 $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $w Mathematical Logic and Theoretical Computer Science $4 070 $a Thapen $b Neil $p MU-W $y CZ $T Matematický ústav AV ČR, v. v. i. 856 $u http://link.springer.com/article/10.1007%2Fs00493-015-3193-9
Počet záznamů: 1