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.
Elementary Methods of Graph Ramsey Theory / Yusheng Li, Qizhong Lin
| Elementary Methods of Graph Ramsey Theory / Yusheng Li, Qizhong Lin |
| Autore | Li, Yusheng |
| Pubbl/distr/stampa | Cham, : Springer, 2022 |
| Descrizione fisica | xiii, 346 p. : ill. ; 24 cm |
| Altri autori (Persone) | Lin, Qizhong |
| Soggetto topico |
05-XX - Combinatorics [MSC 2020]
05C35 - Extremal problems in graph theory [MSC 2020] 05C55 - Generalized Ramsey theory [MSC 2020] 05C75 - Structural characterization of families of graphs [MSC 2020] 05C76 - Graph operations (line graphs, products, etc.) [MSC 2020] 05C80 - Random graphs (graph-theoretic aspects) [MSC 2020] 05D05 - Extremal set theory [MSC 2020] 05D10 - Ramsey theory [MSC 2020] 05D40 - Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) [MSC 2020] 94A24 - Coding theorems (Shannon theory) [MSC 2020] |
| Soggetto non controllato |
Algebraic construction
Graph Ramsey theory Lovász Local Lemma Probabilistic method Quasi-Random Graphs Szemerédi's regularity lemma Turán number |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00277381 |
Li, Yusheng
|
||
| Cham, : Springer, 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Generalized connectivity of graphs / Xueliang Li, Yaping Mao
| Generalized connectivity of graphs / Xueliang Li, Yaping Mao |
| Autore | Li, Xueliang |
| Pubbl/distr/stampa | [Cham], : Springer, 2016 |
| Descrizione fisica | X, 143 p. : ill. ; 24 cm |
| Altri autori (Persone) | Mao, Yaping |
| Soggetto topico |
68Q25 - Analysis of algorithms and problem complexity [MSC 2020]
05C05 - Trees [MSC 2020] 05C75 - Structural characterization of families of graphs [MSC 2020] 05C35 - Extremal problems in graph theory [MSC 2020] 68R10 - Graph theory (including graph drawing) in computer science [MSC 2020] 05C70 - Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) [MSC 2020] 05C80 - Random graphs (graph-theoretic aspects) [MSC 2020] 05C85 - Graph algorithms (graph-theoretic aspects) [MSC 2020] 05C40 - Connectivity [MSC 2020] 05C76 - Graph operations (line graphs, products, etc.) [MSC 2020] 68M10 - Network design and communication in computer systems [MSC 2020] |
| Soggetto non controllato |
Combinatorics
Conjectures Connectivity of Graphs Edge-connectivity Edge-disjoint Steiner trees Extremal graph Graph product Internally disjoint Steiner trees Nordhaus-Gaddum-type result Open Problems Rainbow index of graphs Steiner tree |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN0114793 |
|
Li, Xueliang
|
||
| [Cham], : Springer, 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Generalized connectivity of graphs / Xueliang Li, Yaping Mao
| Generalized connectivity of graphs / Xueliang Li, Yaping Mao |
| Autore | Li, Xueliang |
| Pubbl/distr/stampa | [Cham], : Springer, 2016 |
| Descrizione fisica | X, 143 p. : ill. ; 24 cm |
| Altri autori (Persone) | Mao, Yaping |
| Soggetto topico |
05C05 - Trees [MSC 2020]
05C35 - Extremal problems in graph theory [MSC 2020] 05C40 - Connectivity [MSC 2020] 05C70 - Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) [MSC 2020] 05C75 - Structural characterization of families of graphs [MSC 2020] 05C76 - Graph operations (line graphs, products, etc.) [MSC 2020] 05C80 - Random graphs (graph-theoretic aspects) [MSC 2020] 05C85 - Graph algorithms (graph-theoretic aspects) [MSC 2020] 68M10 - Network design and communication in computer systems [MSC 2020] 68Q25 - Analysis of algorithms and problem complexity [MSC 2020] 68R10 - Graph theory (including graph drawing) in computer science [MSC 2020] |
| Soggetto non controllato |
Combinatorics
Conjectures Connectivity of Graphs Edge-connectivity Edge-disjoint Steiner trees Extremal graph Graph product Internally disjoint Steiner trees Nordhaus-Gaddum-type result Open Problems Rainbow index of graphs Steiner tree |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN00114793 |
|
Li, Xueliang
|
||
| [Cham], : Springer, 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Generalized connectivity of graphs / Xueliang Li, Yaping Mao
| Generalized connectivity of graphs / Xueliang Li, Yaping Mao |
| Autore | Li, Xueliang |
| Edizione | [[Cham] : Springer, 2016] |
| Pubbl/distr/stampa | X, 143 p., : ill. ; 24 cm |
| Descrizione fisica | Pubblicazione in formato elettronico |
| Altri autori (Persone) | Mao, Yaping |
| Soggetto topico |
68Q25 - Analysis of algorithms and problem complexity [MSC 2020]
05C05 - Trees [MSC 2020] 05C75 - Structural characterization of families of graphs [MSC 2020] 05C35 - Extremal problems in graph theory [MSC 2020] 68R10 - Graph theory (including graph drawing) in computer science [MSC 2020] 05C70 - Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) [MSC 2020] 05C80 - Random graphs (graph-theoretic aspects) [MSC 2020] 05C85 - Graph algorithms (graph-theoretic aspects) [MSC 2020] 05C40 - Connectivity [MSC 2020] 05C76 - Graph operations (line graphs, products, etc.) [MSC 2020] 68M10 - Network design and communication in computer systems [MSC 2020] |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-SUN0114793 |
|
Li, Xueliang
|
||
| X, 143 p., : ill. ; 24 cm | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Laplacian eigenvectors of graphs : Perron-Frobenius and Faber-Krahn type theorems / Turker Biyikoglu, Josef Leydold, Peter F. Stadler
| Laplacian eigenvectors of graphs : Perron-Frobenius and Faber-Krahn type theorems / Turker Biyikoglu, Josef Leydold, Peter F. Stadler |
| Autore | Biyikoglu, Turker |
| Pubbl/distr/stampa | Berlin, : Springer, 2007 |
| Descrizione fisica | VIII, 115 p. ; 24 cm |
| Altri autori (Persone) |
Leydold, Josef
Stadler, Peter F. |
| Soggetto topico |
05C50 - Graphs and linear algebra (matrices, eigenvalues, etc.) [MSC 2020]
05C05 - Trees [MSC 2020] 05C75 - Structural characterization of families of graphs [MSC 2020] 05C35 - Extremal problems in graph theory [MSC 2020] 15A18 - Eigenvalues, singular values, and eigenvectors [MSC 2020] 05C22 - Signed and weighted graphs [MSC 2020] |
| Soggetto non controllato |
Algorithms
Combinatorics Discrete Dirichlet problem Eigenvectors Graph Laplacian Graphs Matrix theory Nodal domain Perron-Frobenius Theorem Vertices |
| ISBN | 978-35-407-3509-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN0061438 |
|
Biyikoglu, Turker
|
||
| Berlin, : Springer, 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Laplacian eigenvectors of graphs : Perron-Frobenius and Faber-Krahn type theorems / Turker Biyikoglu, Josef Leydold, Peter F. Stadler
| Laplacian eigenvectors of graphs : Perron-Frobenius and Faber-Krahn type theorems / Turker Biyikoglu, Josef Leydold, Peter F. Stadler |
| Autore | Biyikoglu, Turker |
| Pubbl/distr/stampa | Berlin, : Springer, 2007 |
| Descrizione fisica | VIII, 115 p. ; 24 cm |
| Altri autori (Persone) |
Leydold, Josef
Stadler, Peter F. |
| Soggetto topico |
05C05 - Trees [MSC 2020]
05C22 - Signed and weighted graphs [MSC 2020] 05C35 - Extremal problems in graph theory [MSC 2020] 05C50 - Graphs and linear algebra (matrices, eigenvalues, etc.) [MSC 2020] 05C75 - Structural characterization of families of graphs [MSC 2020] 15A18 - Eigenvalues, singular values, and eigenvectors [MSC 2020] |
| Soggetto non controllato |
Algorithms
Combinatorics Discrete Dirichlet problem Eigenvectors Graph Laplacian Graphs Matrix theory Nodal domain Perron-Frobenius Theorem Vertices |
| ISBN | 978-35-407-3509-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN00061438 |
|
Biyikoglu, Turker
|
||
| Berlin, : Springer, 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Laplacian eigenvectors of graphs : Perron-Frobenius and Faber-Krahn type theorems / Turker Biyikoglu, Josef Leydold, Peter F. Stadler
| Laplacian eigenvectors of graphs : Perron-Frobenius and Faber-Krahn type theorems / Turker Biyikoglu, Josef Leydold, Peter F. Stadler |
| Autore | Biyikoglu, Turker |
| Edizione | [Berlin : Springer] |
| Descrizione fisica | Pubblicazione disponibile anche in formato elettronico. |
| Altri autori (Persone) |
Leydold, Josef
Stadler, Peter F. |
| Soggetto topico |
05C50 - Graphs and linear algebra (matrices, eigenvalues, etc.) [MSC 2020]
05C05 - Trees [MSC 2020] 05C75 - Structural characterization of families of graphs [MSC 2020] 05C35 - Extremal problems in graph theory [MSC 2020] 15A18 - Eigenvalues, singular values, and eigenvectors [MSC 2020] 05C22 - Signed and weighted graphs [MSC 2020] |
| ISBN | 978-35-407-3509-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-SUN0061438 |
|
Biyikoglu, Turker
|
||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Some topics in graph theory / H. P. Yap
| Some topics in graph theory / H. P. Yap |
| Autore | Yap, Hian P. |
| Pubbl/distr/stampa | Cambridge, : Cambridge university, 1986 |
| Descrizione fisica | 230 p. ; 23 cm. |
| Soggetto topico |
05-XX - Combinatorics [MSC 2020]
68Q25 - Analysis of algorithms and problem complexity [MSC 2020] 05C25 - Graphs and abstract algebra (groups, rings, fields, etc.) [MSC 2020] 05C35 - Extremal problems in graph theory [MSC 2020] 68R10 - Graph theory (including graph drawing) in computer science [MSC 2020] 05C70 - Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) [MSC 2020] 05C15 - Coloring of graphs and hypergraphs [MSC 2020] |
| ISBN | 978-05-213-3944-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-SUN0047166 |
|
Yap, Hian P.
|
||
| Cambridge, : Cambridge university, 1986 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Some topics in graph theory / H. P. Yap
| Some topics in graph theory / H. P. Yap |
| Autore | Yap, Hian P. |
| Pubbl/distr/stampa | Cambridge, : Cambridge university, 1986 |
| Descrizione fisica | 230 p. ; 23 cm |
| Soggetto topico |
05-XX - Combinatorics [MSC 2020]
68Q25 - Analysis of algorithms and problem complexity [MSC 2020] 05C25 - Graphs and abstract algebra (groups, rings, fields, etc.) [MSC 2020] 05C35 - Extremal problems in graph theory [MSC 2020] 68R10 - Graph theory (including graph drawing) in computer science [MSC 2020] 05C70 - Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) [MSC 2020] 05C15 - Coloring of graphs and hypergraphs [MSC 2020] |
| ISBN | 978-05-213-3944-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0047166 |
|
Yap, Hian P.
|
||
| Cambridge, : Cambridge university, 1986 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Some topics in graph theory / H. P. Yap
| Some topics in graph theory / H. P. Yap |
| Autore | Yap, Hian P. |
| Pubbl/distr/stampa | Cambridge, : Cambridge university, 1986 |
| Descrizione fisica | 230 p. ; 23 cm |
| Soggetto topico |
05-XX - Combinatorics [MSC 2020]
05C15 - Coloring of graphs and hypergraphs [MSC 2020] 05C25 - Graphs and abstract algebra (groups, rings, fields, etc.) [MSC 2020] 05C35 - Extremal problems in graph theory [MSC 2020] 05C70 - Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) [MSC 2020] 68Q25 - Analysis of algorithms and problem complexity [MSC 2020] 68R10 - Graph theory (including graph drawing) in computer science [MSC 2020] |
| ISBN | 978-05-213-3944-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00047166 |
|
Yap, Hian P.
|
||
| Cambridge, : Cambridge university, 1986 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Soggetto topico
-
05C35 - Extremal problems in graph theory [MSC 2020]
(16)
- 05C05 - Trees [MSC 2020] (9)
- 68Q25 - Analysis of algorithms and problem complexity [MSC 2020] (9)
- 05C75 - Structural characterization of families of graphs [MSC 2020] (7)
- 05C70 - Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) [MSC 2020] (6)