Počet záznamov: 1
On a problem of Mariusz Meszka
SYS 0233832 005 20240514002026.7 014 $a 000345481100017 $2 WOS CC. SCIE 014 $a 2-s2.0-84908190501 $2 SCOPUS 017 70
$a 10.1016/j.disc.2014.08.019 $2 DOI 035 $a biblio/669692 $2 CREPC2 100 $a 20160922 2015 m y slo 03 ba 101 0-
$a eng 102 $a NL 200 1-
$a On a problem of Mariusz Meszka $f Alexander Rosa 330 $a © 2014 Elsevier B.V.We consider a problem due to Mariusz Meszka similar to the well-known conjecture of Marco Buratti. Does there exist a near-1-factor in the complete graph on Zp, p is an odd prime, whose set of edge-lengths equals a given multiset L? We establish several sufficient conditions for the answer to be yes. 463 -1
$1 001 umb_un_cat*0297332 $1 011 $a 0012-365X $1 011 $a 1872-681X $1 200 1 $a Discrete Mathematics $v Vol. 338, no. 1 (2015), pp. 139-143 $1 210 $a Amsterdam $c Elsevier B.V. $d 2015 606 0-
$3 umb_un_auth*0036218 $a matematika $X mathematics 606 0-
$3 umb_un_auth*0039537 $a grafy $X charts $X graphs 615 $n 51 $a Matematika 675 $a 51 700 -1
$a Rosa $b Alexander $3 umb_un_auth*0120025 $p UMBFP10 $4 070 $9 100 $f 1937- $T Katedra matematiky 801 -0
$a SK $b BB301 $g AACR2 $9 unimarc sk T85 $x existuji fulltexy
Počet záznamov: 1