Fete of combinatorics and computer science
Discrete Mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and m...
Enregistré dans:
| Hovedforfatter: | |
|---|---|
| Andre forfattere: | , |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| Serier: | Bolyai Society Mathematical Studies
20 |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme de l'éditeur (Springer) Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Fete of combinatorics and computer science, Gyula O. H. Katona, Alexander Schrijver, Tamás Szőnyi, Gábor Sági (Eds.), 2010, Berlin, Springer, János Bolyai mathematical society, 1 vol. (365 p.), Bolyai Society Mathematical Studies, 978-3-642-13579-8 • Fete of Combinatorics and Computer Science, Texte imprimé, 9783642135811 • Fete of Combinatorics and Computer Science, Texte imprimé, 9783662506424 |
Indholdsfortegnelse:
- High Degree Graphs Contain Large-Star Factors
- Iterated Triangle Partitions
- PageRank and Random Walks on Graphs
- Solution of Peter Winkler s Pizza Problem*
- Tight Bounds for Embedding Bounded Degree Trees
- Betti Numbers are Testable*
- Rigid and Globally Rigid Graphs with Pinned Vertices
- Noise Sensitivity and Chaos in Social Choice Theory
- Coloring Uniform Hypergraphs with Small Edge Degrees
- Extremal Graphs and Multigraphs with Two Weighted Colours
- Regularity Lemmas for Graphs
- Edge Coloring Models as Singular Vertex Coloring Models
- List Total Weighting of Graphs
- Open Problems.