000 02367nam a22004335i 4500
001 u373941
003 SIRSI
005 20160812084210.0
007 cr nn 008mamaa
008 110608s2011 gw | s |||| 0|eng d
020 _a9783642111105
_9978-3-642-11110-5
040 _cMX-MeUAM
050 4 _aQA639.5-640.7
050 4 _aQA640.7-640.77
082 0 4 _a516.1
_223
100 1 _aBarlotti, A.
_eeditor.
245 1 0 _aMatroid Theory and its Applications
_h[recurso electrónico] /
_cedited by A. Barlotti.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2011.
300 _a424 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aC.I.M.E. Summer Schools ;
_v83
505 0 _aM. Barnabei, A. Brini, G.-C. Rota: Un’introduzione alla teoria delle funzioni di Möbius -- A. Brini: Some remarks on the critical problem -- T.H. Brylawski: The Tutte polynomial -- J. Oxley: On 3-connected matroids and graphs -- R. Peele: The poset of subpartitions and Cayley’s formula for the complexity of a complete graph -- A. Recski: Engineering applications of matroids -- D.J.A. Welsh: Matroids and combinatorial optimisation -- T. Zaslavisky: Voltage-graphic matroids.
520 _aLectures: T.H. Brylawski: The Tutte polynomial.- D.J.A. Welsh: Matroids and combinatorial optimisation.- Seminars: M. Barnabei, A. Brini, G.-C. Rota: Un’introduzione alla teoria delle funzioni di Möbius.- A. Brini: Some remarks on the critical problem.- J. Oxley: On 3-connected matroids and graphs.- R. Peele: The poset of subpartitions and Cayley’s formula for the complexity of a complete graph.- A. Recski: Engineering applications of matroids.- T. Zaslavisky: Voltage-graphic matroids.
650 0 _aMathematics.
650 0 _aDiscrete groups.
650 1 4 _aMathematics.
650 2 4 _aConvex and Discrete Geometry.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642111099
830 0 _aC.I.M.E. Summer Schools ;
_v83
856 4 0 _zLibro electrónico
_uhttp://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-11110-5
596 _a19
942 _cLIBRO_ELEC
999 _c201821
_d201821