LEADER 00813nam a22002413i 4500
001 991004346027907536
005 20241014103911.0
008 241014s1961    it  |||er|||| 001|p|ita d
040   $aBibl. Dip.le Aggr. Scienze Umane e Sociali$bita$cSocioculturale Scs
041 1 $aita$heng
082 04$a811.5$223
100 1 $aPound, Ezra$0118310
245 13$aLe poesie scelte /$cEzra Pound ; con una prefazione di T. S. Eliot ; traduzione di Alfredo Rizzardi
250   $a2. edizione
260   $aMilano :$bA. Mondadori,$c1961
300   $a210 p. ;$c20 cm
490 1 $aLo specchio. I poeti del nostro tempo
700 1 $aEliot, Thomas Stearns
700 1 $aRizzardi, Alfredo
830  3$aLo specchio.$pI poeti del nostro tempo
912   $a991004346027907536
996   $aPoesie scelte$9133476
997   $aUNISALENTO

LEADER 02980nam  22006015  450 
001 9910299966003321
005 20250609111234.0
010   $a88-7642-525-X
024 7 $a10.1007/978-88-7642-525-7
035   $a(CKB)3710000000394755
035   $a(EBL)2095447
035   $a(SSID)ssj0001501494
035   $a(PQKBManifestationID)11896729
035   $a(PQKBTitleCode)TC0001501494
035   $a(PQKBWorkID)11446562
035   $a(PQKB)10032617
035   $a(MiAaPQ)EBC2095447
035   $a(DE-He213)978-88-7642-525-7
035   $a(PPN)185486932
035   $a(MiAaPQ)EBC3109354
035   $a(EXLCZ)993710000000394755
100   $a20150409d2014      u|         0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 10$aGeometry, Structure and Randomness in Combinatorics /$fedited by Ji?í Matousek, Jaroslav Ne?et?il, Marco Pellegrini
205   $a1st ed. 2014.
210  1$aPisa :$cScuola Normale Superiore :$cImprint: Edizioni della Normale,$d2014.
215   $a1 online resource (156 p.)
225 1 $aCRM Series,$x2239-4524 ;$v18
300   $aDescription based upon print version of record.
311 08$a88-7642-524-1 
320   $aIncludes bibliographical references.
327   $aImre Bárány: Tensors, colours, octahedral -- Maria Chudnovsky: Cliques and stable sets in undirected graphs -- Mauro Di Nasso: A taste of nonstandard methods in combinatorics of numbers -- Béla Bollobás, Zoltán Füredi, Ida Kantor, G. O. H. Katona and Imre Leader: A coding problem for pairs of subsets -- Jirí Matousek: String graphs and separators -- Jaroslav Nesetril and Patrice Ossona de Mendez: On first-order definable colorings -- Ryan Schwartz and József Solymosi: Combinatorial applications of the subspace theorem -- Peter Hegarty and Dmitry Zhelezov: Can connected commuting graphs of finite groups have arbitrarily large diameter?
330   $aThis book collects some surveys on current trends in discrete mathematics and discrete geometry. The areas covered include:  graph representations, structural graphs theory, extremal graph theory, Ramsey theory and constrained satisfaction problems.
410  0$aCRM Series,$x2239-4524 ;$v18
606   $aConvex geometry
606   $aDiscrete geometry
606   $aConvex and Discrete Geometry$3https://scigraph.springernature.com/ontologies/product-market-codes/M21014
615  0$aConvex geometry.
615  0$aDiscrete geometry.
615 14$aConvex and Discrete Geometry.
676   $a510
676   $a516.1
702   $aMatousek$b Ji?í$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aNe?et?il$b Jaroslav$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aPellegrini$b Marco$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a9910299966003321
996   $aGeometry, structure and randomness in combinatorics$91410008
997   $aUNINA