LEADER 02297nam0 22005293i 450 001 VAN0274869 005 20240618104431.252 017 70$2N$a9783030712501 100 $a20240412d2021 |0itac50 ba 101 $aeng 102 $aCH 105 $a|||| ||||| 200 1 $aLessons in Enumerative Combinatorics$fÖmer E?ecio?lu, Adriano M. Garsia 210 $aCham$cSpringer$d2021 215 $axvi, 479 p.$cill.$d24 cm 410 1$1001VAN0023579$12001 $aGraduate texts in mathematics$1210 $aNew York [etc.]$cSpringer$v290 606 $a05-XX$xCombinatorics [MSC 2020]$3VANC019812$2MF 606 $a05C10$xPlanar graphs; geometric and topological aspects of graph theory [MSC 2020]$3VANC021385$2MF 606 $a68Q45$xFormal languages and automata [MSC 2020]$3VANC021434$2MF 606 $a05A19$xCombinatorial identities, bijective combinatorics [MSC 2020]$3VANC021555$2MF 606 $a05A15$xExact enumeration problems, generating functions [MSC 2020]$3VANC021558$2MF 606 $a05C05$xTrees [MSC 2020]$3VANC022107$2MF 606 $a05C25$xGraphs and abstract algebra (groups, rings, fields, etc.) [MSC 2020]$3VANC022402$2MF 606 $a05A18$xPartitions of sets [MSC 2020]$3VANC033728$2MF 610 $aBijective proofs$9KW:K 610 $aCayley trees$9KW:K 610 $aCombinatorics$9KW:K 610 $aCombinatorics computer science$9KW:K 610 $aCombinatorics formal languages$9KW:K 610 $aDeterminantal formula$9KW:K 610 $aExponential structures$9KW:K 610 $aFirst available matching algorithm$9KW:K 610 $aGenerating functions$9KW:K 610 $aGraph coloring$9KW:K 610 $aInclusion-Exclusion Principle$9KW:K 610 $aLagrange Inversion$9KW:K 610 $aPlanar trees$9KW:K 620 $aCH$dCham$3VANL001889 700 1$aE?ecio?lu$bÖmer$3VANV106469$0791288 701 1$aGarsia$bAdriano M.$3VANV106468$056880 712 $aSpringer $3VANV108073$4650 801 $aIT$bSOL$c20240621$gRICA 856 4 $uhttps://doi.org/10.1007/978-3-030-71250-1$zE-book ? Accesso al full-text attraverso riconoscimento IP di Ateneo, proxy e/o Shibboleth 912 $fN 912 $aVAN0274869 996 $aLessons in Enumerative Combinatorics$94153293 997 $aUNICAMPANIA