Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Geometry, Structure and Randomness in Combinatorics [[electronic resource] /] / edited by Jiří Matousek, Jaroslav Nešetřil, Marco Pellegrini
| Geometry, Structure and Randomness in Combinatorics [[electronic resource] /] / edited by Jiří Matousek, Jaroslav Nešetřil, Marco Pellegrini |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Pisa : , : Scuola Normale Superiore : , : Imprint : Edizioni della Normale, , 2014 |
| Descrizione fisica | 1 online resource (156 p.) |
| Disciplina |
510
516.1 |
| Collana | CRM Series |
| Soggetto topico |
Convex geometry
Discrete geometry Convex and Discrete Geometry |
| ISBN | 88-7642-525-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Imre 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? |
| Record Nr. | UNINA-9910299966003321 |
| Pisa : , : Scuola Normale Superiore : , : Imprint : Edizioni della Normale, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Network Bioscience
| Network Bioscience |
| Autore | Pellegrini Marco |
| Pubbl/distr/stampa | Frontiers Media SA, 2020 |
| Descrizione fisica | 1 electronic resource (270 p.) |
| Soggetto topico |
Science: general issues
Medical genetics |
| Soggetto non controllato |
systems biology
network science network biology cancer networks hypothesis generation and verification computational biology |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910557261503321 |
Pellegrini Marco
|
||
| Frontiers Media SA, 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Network Bioscience, 2nd Edition
| Network Bioscience, 2nd Edition |
| Autore | Pellegrini Marco |
| Pubbl/distr/stampa | Frontiers Media SA, 2020 |
| Descrizione fisica | 1 electronic resource (270 p.) |
| Soggetto topico |
Science: general issues
Medical genetics |
| Soggetto non controllato |
systems biology
network science network biology cancer networks hypothesis generation and verification computational biology |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910557698503321 |
|
Pellegrini Marco
|
||
| Frontiers Media SA, 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The Seventh European Conference on Combinatorics, Graph Theory and Applications [[electronic resource] ] : EuroComb 2013 / / edited by Jaroslav Nešetřil, Marco Pellegrini
| The Seventh European Conference on Combinatorics, Graph Theory and Applications [[electronic resource] ] : EuroComb 2013 / / edited by Jaroslav Nešetřil, Marco Pellegrini |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Pisa : , : Scuola Normale Superiore : , : Imprint : Edizioni della Normale, , 2013 |
| Descrizione fisica | 1 online resource (612 p.) |
| Disciplina |
511.5
511.6 |
| Collana | CRM Series |
| Soggetto topico |
Combinatorics
Graph theory Graph Theory |
| ISBN | 88-7642-475-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
""Cover""; ""Title Page""; ""Copyright Page""; ""Table of Contents""; ""Foreword""; ""Invited Speakers""; ""ErdÅ?s problems""; ""A problem of ErdÅ?s and Sós on 3-graphs""; ""1 Introduction""; ""2 Sketch of the proof""; ""References""; ""An analogue of the ErdÅ?s-Ko-Rado theorem for multisets""; ""1 Introduction""; ""1.1 Definitions, notation""; ""1.2 History""; ""1.3 Conjectures""; ""1.4 Results""; ""2 Concluding remarks""; ""References""; ""Polynomial gap extensions of the ErdÅ?sâ€?Pósa theorem""; ""1 Introduction""; ""2 Excluding packings of planar graphs""; ""References""
""The ErdÅ?s-Pósa property for long circuits""""1 Introduction""; ""2 Proof of Theorem 1.1""; ""References""; ""Hypergraphs""; ""A hypergraph Turán theorem via Lagrangians of intersecting families""; ""1 Introduction""; ""2 Lagrangians of intersecting 3-graphs""; ""3 An application to a hypergraph Turán problem""; ""3.1 Stability""; ""4 Concluding remarks and open problems""; ""References""; ""Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs""; ""1 Introduction""; ""2 Overview of the proof of Theorem 1.1""; ""Almost perfect matchings""; ""Absorbing sets"" ""The auxiliary graph G""""References""; ""Fractional and integer matchings in uniform hypergraphs""; ""Large matchings in hypergraphs with many edges""; ""Large matchings in hypergraphs with large degrees""; ""Large fractional matchings""; ""References""; ""Cubic graphs""; ""On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings""; ""1 Introduction""; ""2 Aninfinite family of snarks with excessive index 5""; ""3 Shortest cycle cover""; ""4 Open problems""; ""References""; ""Relating ordinary and total domination in cubic graphs of large girth""; ""References"" ""Snarks with large oddness and small number of vertices""""1 Introduction""; ""2 Oddness and resistance ratios""; ""3 Lower bounds on oddness ratio""; ""4 Constructions""; ""References""; ""Non-trivial snarks with given circular chromatic index""; ""1 Introduction""; ""2 Balanced schemes""; ""References""; ""Graphs""; ""The graph formulation of the union-closed sets conjecture""; ""References""; ""The union-closed sets conjecture almost holds for almost all random bipartite graphs""; ""1 Introduction""; ""2 Discussion of averaging""; ""3 Sketch of the proof of Theorem 2.2""; ""References"" ""The robust component structure of dense regular graphs""""1 Introduction""; ""2 Two applications to longest cycles in regular graphs""; ""3 Sketch of the proof of Theorems 1.2 and 2.2""; ""3.1 Sketch proof of Theorem 1.2""; ""3.2 Sketch proof of Theorem 2.2""; ""References""; ""The (â??, D) and (â??, N) problemsin double-step digraphs with unilateral diameter""; ""1 Preliminaries""; ""1.1 Double-step digraphs""; ""1.2 Unilateral distance""; ""2 The unilateral diameter of double-step digraphs with step a=1"" ""3 The(â??, D*) and (â??,N)* problems for double-step digraphs with unilateral diameter"" |
| Record Nr. | UNINA-9910438136803321 |
| Pisa : , : Scuola Normale Superiore : , : Imprint : Edizioni della Normale, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||