Počet záznamů: 1
The approximate Loebl-Komlós--Sós conjecture and embedding trees in sparse graphs
SYS 0443855 LBL 02426^^^^^2200385^^^450 005 20240103210041.0 014 $a 84937435535 $2 SCOPUS 014 $a 000361819700001 $2 WOS 017 70
$a 10.3934/era.2015.22.1 $2 DOI 100 $a 20150511d m y slo 03 ba 101 0-
$a eng $d eng 102 $a US 200 1-
$a The approximate Loebl-Komlós--Sós conjecture and embedding trees in sparse graphs 215 $a 11 s. 463 -1
$1 001 cav_un_epca*0327615 $1 011 $e 1935-9179 $a 1935-9179 $1 200 1 $a Electronic Research Announcements in Mathematical Sciences $v Roč. 22, April (2015), s. 1-11 610 0-
$a extremal graph theory 610 0-
$a Loebl-Komlós-Sós conjecture 610 0-
$a regularity lemma 700 -1
$3 cav_un_auth*0309061 $a Hladký $b Jan $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $p MU-W $w Mathematical Logic and Theoretical Computer Science $4 070 $T Matematický ústav AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0315926 $a Piguet $b Diana $i Oddělení teoretické informatiky $j Department of Theoretical Computer Science $p UIVT-O $w Department of Theoretical Computer Science $4 070 $T Ústav informatiky AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0316678 $a Simonovits $b M. $y HU $4 070 701 -1
$3 cav_un_auth*0316679 $a Stein $b M. $y CL $4 070 701 -1
$3 cav_un_auth*0316680 $a Szemerédi $b E. $y US $4 070 856 $u http://www.aimsciences.org/journals/displayArticlesnew.jsp?paperID=11110
Počet záznamů: 1